应用量子盲签名和群签名的电子支付系统

提出了一个基于量子群签名和盲签名电子支付系统的实现方案。基于经典的签名的现有的电子支付系统不能保证无条件安全性。与经典的电子支付系统不同,提出的方案既能满足电子支付系统的需求,又能实现无条件安全。应用量子密钥分发技术,量子一次一密算法和审计机制实现了基于量子签名的电子支付系统。     

How to improve snap-stabilizing point-to-point communication space complexity?

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context of an arbitrary initialization (due to stabilization), this information may be corrupted. In Cournier et al. (2009) [1], we show that there exist snap-stabilizing algorithms for this problem (in the state model). This implies that we can request the system to begin forwarding messages without losses even if routing information is initially corrupted.In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one in Cournier et al. (2009) [1].     

An anonymity-revoking e-payment system with a smart card

An untraceable offline e-payment system can offer a degree of customer anonymity; however, it also presents criminals with opportunities, such as laundering money, corruption, and kidnapping. In this paper, we improve on the e-payment system with a smart card proposed by S. Brands, and present an anonymity-revoking e-payment system. On the one hand, the customer’s privacy cannot be compromised by the bank or by the payee. On the other hand, anonymity can be removed by a trusted third party (trustee) with the help of the bank. In this case, the third party can link a payment to a corresponding withdrawal and prevent money laundering and blackmailing. Published online: 4 December 2001     

Privacy-preserving e-payments using one-time payment details

The recent increase in data breaching incidents involving high profile e-commerce companies is alarming as such privacy threats can seriously thwart the healthy growth of electronic commerce. We propose a privacy-preserving e-payment scheme that guarantees authenticity while keeping the customer’s sensitive details secret from the respective parties involved in the online transaction. Using a non-reusable password-based authentication approach, the proposed protocol allows consumers to anonymously purchase goods from an online merchant, thus achieving the ideal privacy environment in which to shop. The protocol can be easily deployed in an e-commerce environment without requiring great changes to the current processes.     

Foundations of compositional models: structural properties

The paper is a follow-up of [R.J.: Foundations of compositional model theory. IJGS, 40(2011): 623–678], where basic properties of compositional models, as one of the approaches to multidimensional probability distributions representation and processing, were introduced. In fact, it is an algebraic alternative to graphical models, which does not use graphs to represent conditional independence statements. Here, these statements are encoded in a sequence of distributions to which an operator of composition – the key element of this theory – is applied in order to assemble a multidimensional model from its low-dimensional parts. In this paper, we show a way to read conditional independence relations, and to solve related topics, above all the so-called equivalence problem, i.e. the problem of recognizing whether two different structures induce the same system of conditional independence relations.     

Forecasting conditional correlations in stock,bond and foreign exchange markets

The paper forecasts conditional correlations between three classes of international financial assets, namely stock, bond and foreign exchange. Two countries are considered, namely Australia and New Zealand. Forecasting will be conducted using three multivariate GARCH models, namely the CCC model [T. Bollerslev, Modelling the coherence in short-run nominal exchange rates: a multivariate generalized ARCH model, Rev. Econ. Stat. 72 (1990) 498–505], VARMA-GARCH model [S. Ling, M. McAleer, Asymptotic theory for a vector ARMA-GARCH model, Econometric Theory 19 (2003) 280–310], and VARMA-AGARCH model [M. McAleer, S. Hoti, F. Chan, Structure and asymptotic theory for multivariate asymmetric volatility, Econometric Rev., in press]. A rolling window technique is used to forecast 1-day ahead conditional correlations. To evaluate the impact of model specification on conditional correlations forecasts, this paper calculates and compares the correlations between conditional correlations forecasts resulted from the three models. The paper finds the evidence of volatility spillovers and asymmetric effect of negative and positive shock on the conditional variance in most pairs of series. However, it suggests that incorporating volatility spillovers and asymmetric do not contribute to better conditional correlations forecasts.     

Convergence theorems by a new iteration process for a finite family of nonself asymptotically nonexpansive mappings with errors in Banach spaces

In this paper, we study a new iteration process for a finite family of nonself asymptotically nonexpansive mappings with errors in Banach spaces. We prove some weak and strong convergence theorems for this new iteration process. The results of this paper improve and extend the corresponding results of Chidume et al. (2003) [10], Osilike and Aniagbosor (2000) [3], Schu (1991) [4], Takahashi and Kim (1998) [9], Tian et al. (2007) [18], Wang (2006) [11], Yang (2007) [17] and others.     

一种可信的网上银行认证协议的分析与设计

随着电子支付的普及,安全问题成为了影响其发展的关键问题之一。可信计算平台、PKI认证系统都是保证安全的有效机制。在分析这两种安全机制的基础上,提出了一种结合可信平台和PKI认证系统的网上银行认证协议,通过可信平台模块TPM保证了参与方的计算平台可信性,使用PKI系统和智能卡对银行、持卡人、读卡器进行了身份认证,完成了认证过程,达到安全可信的认证目的。     

A secure and efficient authenticated encryption for electronic payment systems using elliptic curve cryptography

The use of e-payment system for electronic trade is on its way to make daily life more easy and convenient. Contrarily, there are a number of security issues to be addressed, user anonymity and fair exchange have become important concerns along with authentication, confidentiality, integrity and non-repudiation. In a number of existing e-payment schemes, the customer pays for the product before acquiring it. Furthermore, many such schemes require very high computation and communication costs. To address such issues recently Yang et al. proposed an authenticated encryption scheme and an e-payment scheme based on their authenticated encryption. They excluded the need of digital signatures for authentication. Further they claimed their schemes to resist replay, man-in-middle, impersonation and identity theft attack while providing confidentiality, authenticity, integrity and privacy protection. However our analysis exposed that Yang et al.’s both authenticated encryption scheme and e-payment system are vulnerable to impersonation attack. An adversary just having knowledge of public parameters can easily masquerade as a legal user. Furthermore, we proposed improved authenticated encryption and e-payment schemes to overcome weaknesses of Yang et al.’s schemes. We prove the security of our schemes using automated tool ProVerif. The improved schemes are more robust and more lightweight than Yang et al.’s schemes which is evident from security and performance analysis.     

Independence and Possibilistic Conditioning

There is not a unique definition of a conditional possibility distribution since the concept of conditioning is complex and many papers have been conducted to define conditioning in a possibilistic framework. In most cases, independence has been also defined and studied by means of a kind of analogy with the probabilistic case. In [2,4], we introduce conditional possibility as a primitive concept by means of a function whose domain is a set of conditional events. In this paper, we define a concept of independence associated with this form of conditional possibility and we show that classical properties required for independence concepts are satisfied.     

An empirical study of customers’ perceptions of security and trust in e-payment systems

It is commonly believed that good security improves trust, and that the perceptions of good security and trust will ultimately increase the use of electronic commerce. In fact, customers’ perceptions of the security of e-payment systems have become a major factor in the evolution of electronic commerce in markets. In this paper, we examine issues related to e-payment security from the viewpoint of customers. This study proposes a conceptual model that delineates the determinants of consumers’ perceived security and perceived trust, as well as the effects of perceived security and perceived trust on the use of e-payment systems. To test the model, structural equation modeling is employed to analyze data collected from 219 respondents in Korea. This research provides a theoretical foundation for academics and also practical guidelines for service providers in dealing with the security aspects of e-payment systems.     

Cyclic coding algorithms under MorphoSys reconfigurable computing system

This paper introduces reconfigurable computing (RC) and specifically chooses one of the prototypes in this field, MorphoSys (M1) [1], [2], [3], [4], [5]. The paper addresses the results obtained when using RC in mapping algorithms pertaining to digital coding in relation to previous research [6], [7], [8], [9], [10]. The chosen algorithms relate to cyclic coding techniques, namely the CCITT CRC-16 and the CRC-16. A performance analysis study of the M1 RC system is also presented to evaluate the efficiency of the algorithm execution on the M1 system. For comparison purposes, three other systems were used to map the same algorithms showing the advantages and disadvantages of each compared with the M1 system. The algorithms were run on the 8×8 RC (reconfigurable) array of the M1 (MorphoSys) system; numerical examples were simulated to validate our results, using the MorphoSys mULATE program, which simulates MorphoSys operations.     

What can the canonical controller in principle tell us?

Given a plant and a desired specification our goal is to construct a controller system which, when interconnected with the plant, yields a system that behaves like the desired specification. We can always construct the canonical controller introduced in van der Schaft (2003) [10]. For linear systems there exists a controller which when interconnected to the plant yields the desired behaviour if and only if the canonical controller is itself one such controller, see Vinjamoor and van der Schaft (2011) [4]. In this paper we extend this result to nonlinear systems. It turns out that one has to look at the canonical controller together with its subsystems. We obtain necessary and sufficient conditions for the existence of a controller for a class of nonlinear systems. We end with examples which show that in certain cases looking at subsystems of the canonical controller also does not suffice.     

基于有限支付API条件下B2B支付实现方案研究

首先对中国B2B电子支付的现状及两种解决方案进行了分析,然后提出了一种基于中国目前银行界可提供的有限功能支付API条件之下的B2B支付实现方案,该方案在一定程度上能够解决目前中国B2B支付面临的跨行支付难,支付效率低等主要问题,是一种可行的解决方案,对中国B2B电子商务的发展具有一定理论和现实上的指导意义。     

极大限制边连通网络的充分条件

限制边连通度是度量网络可靠性的重要参数。设[G]是一个边集为[E]的连通网络。称一个边集合[S?E]是一个限制边割,如果[G-S]是不连通的且每个分支至少有两个顶点。网络[G]的限制边连通度,记为[λ'],定义为[G]的最小限制边割的基数。设[d(v)]表示顶点[v]的度,[ξ=min{d(u)+d(v)-2:uv∈E}]表示[G]的最小边度。称网络[G]是极大限制边连通的,如果[λ'=ξ]。给出了网络是极大限制边连通的一些充分条件。     

Models and data engineering

Data and models are two well established communities that are continuously contributing in new challenges in different research domains including cyber-physical systems  [1], cloud computing [2], service oriented applications, social networks [3], big data (with its five Vs characteristics: Volume, Variety, Velocity, Veracity and Value)  [4], etc. The success story of data and models communities is mainly based on the availability of foundations relying on formal methods [5], modelling methods  [6], storage systems and platforms  [7], advanced optimization structures, benchmarking, scalability, etc. These foundations are usually associated with tools and commercial and academic systems.The selected papers for this special issue address a variety of topics and concerns in models and data fields, including advanced databases, engagement systems, embedded and complex systems, etc.     

On approximating the conditional wait process of general multiserver queueing systems

In view of the extremely difficult task of analyzing G/G/K queueing systems, relatively few general results have been established. Most of the literature dealing with the G/G/K system has been concerned with the heavy traffic situation. Of special note are the bounds given by Kingman[7] on the wait process, the weak convergence theorems established by Iglehart and Whitt[4] and Loulou[8], and the many server approximations due to Newell[9].In this paper a presentation will be made of new formulas constructed to approximate the mean and variance of the conditional wait process. Two key concepts play major roles behind the formulas to be presented. They are: (a) the use of a continuous (diffusion-type) process to approximate the steady-state probabilities of the number in the queue, and (b) the substitution of the original process of interdeparture times by a process of independent variables.In order to assess the quality of the suggested approximation for the mean and variance of the conditional wait process, the approximation will be numerically compared with the results obtained from Kingman's[7] and Kendall's[5] exact formula for the special case of the G/M/K system, and will be tested against point estimate simulations.     

An adaptive variable structure control for a class of nonlinear systems

Motivated by the recent advance in adaptive output-feedback control for a class of nonlinear systems which can be transformed into the so-called output-feedback form [7,10,11], an adaptive structure controller is proposed in this paper to solve the nonlinear model reference adaptive control problem. It is shown that an asymptotic output tracking performance can be achieved for this class of nonlinear system even if some nonlinearity is not available or some unknown parameters are fast time-varying.     

Contexts, refinement and determinism

In this paper we have been influenced by those who take an “engineering view” of the problem of designing systems, i.e. a view that is motivated by what someone designing a real system will be concerned with, and what questions will arise as they work on their design. Specifically, we have borrowed from the testing work of Hennessy, de Nicola and van Glabbeek, e.g. Hennessy, 1988 [13], de Nicola [5], de Nicola, 1992 [21] and van Glabbeek, 2001, 1990 [40] and [39].Here we concentrate on one fundamental part of the engineering view and where consideration of it leads. The aspects we are concerned with are computational entities in contexts, observed by users. This leads to formalising design steps that are often left informal, and that in turn gives insights into non-determinism and ultimately leads to being able to use refinement in situations where existing techniques fail.