搜索结果: 1-15 共查到“知识库 divisible”相关记录27条 . 查询时间(0.553 秒)
Divisible E-Cash from Constrained Pseudo-Random Functions
E-Cash anonymity Constrained PRF
2019/2/26
Electronic cash (e-cash) is the digital analogue of regular cash which aims at preserving users' privacy. Following Chaum's seminal work, several new features were proposed for e-cash to address the p...
AEP-M: Practical Anonymous E-Payment for Mobile Devices using ARM TrustZone and Divisible E-Cash (Full Version)
E-Payment Privacy Mobile Devices TrustZone
2016/5/23
Electronic payment (e-payment) has been widely applied to electronic commerce and has especially attracted a large number of mobile users. However, current solutions often focus on protecting users' m...
Divisible E-cash systems allow users to withdraw a unique coin of value 2n
from a bank, but
then to spend it in several times to distinct merchants. In such a system, whereas users want anonymity of...
Divisible E-cash has been introduced twenty years ago but no construction is both fully secure in the standard model and efficiently scalable. In this paper, we fill this gap by providing an anonymous...
Practical Divisible E-Cash
E-Cash divisible constant-size
2015/12/31
Divisible e-cash systems allow a user to withdraw a wallet containing K coins and to spend
k ≤ K coins in a single operation, respectively. Independent of the new work of Canard, Pointcheval,
...
Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash
Divisible E-Cash Anonymity Bilinear Groups
2015/12/22
Divisible e-cash, proposed in 1991 by Okamoto and Ohta, addresses a practical concern
of electronic money, the problem of paying the exact amount. Users of such systems can indeed
withdraw coins of ...
Divisible Transition Systems and Multiplanar Dependency Parsing
Divisible Transition Systems Multiplanar Dependency Parsing
2015/9/11
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often form...
Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile
Strong Spherical Asymptotics Rotor-Router Aggregation Divisible Sandpile
2015/8/14
The rotor-router model is a deterministic analogue of random walk.It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is a...
EQUATIONS SOLVABLE BY RADICALS IN A UNIQUELY DIVISIBLE GROUP
EQUATIONS SOLVABLE RADICALS UNIQUELY DIVISIBLE GROUP
2015/8/14
We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X, A) = B, where w is a finite word in the alphabet {X,...
The divisible sandpile starts with i.i.d. random variables (“masses”) at the vertices of an infinite, vertex-transitive graph, and redistributes mass by a local toppling rule in an attempt to make all...
A class of loops categorically isomorphic to uniquely 2-divisible Bruck loops
T-loops Bruck loops uniquely 2-divisible power-associativity
2012/6/26
We define a new variety of loops we call $\Gamma$-loops. After showing $\Gamma$-loops are power associative, our main goal will be showing a categorical isomorphism between uniquely 2-divisible Bruck ...
On $d$-divisible graceful $α$-labelings of $C_{4k}\times P_m$
graceful labeling α-labeling graph decomposition
2011/8/26
Abstract: In a previous paper the concept of a $d$-divisible graceful $\alpha$-labeling has been introduced as a generalization of classical $\alpha$-labelings and it has been shown how it is useful t...
Description of limits of ranges of iterations of stochastic integral mappings of infinitely divisible distributions
completely selfdecomposable distribution infinitely divisible dis-tribution
2011/1/17
For infinitely divisible distributions on Rd the stochastic integral map-ping f is defined as the distribution of improper stochastic integral R∞−0 f(s)dX() s ,where f(s) is a non-random f...
Corrigendum --- Quadratic Class Numbers Divisible by 3
Corrigendum Quadratic Class Numbers Divisible by 3
2010/12/10
In attempting to handle N+(X) the paper states that the Scholz reflection principle “yields 3|h(k) for any positive integer for which 3|h(−3k)”. This is not correct, and one cannot establish a r...
Almost regular involutory automorphisms of uniquely 2-divisible groups
almost regular involutory automorphism uniquely 2-divisible group
2010/11/29
We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.