Sciweavers

18 search results - page 1 / 4
» A New and Efficient Signature on Commitment Values
Sort
View
IJNSEC
2008
112views more  IJNSEC 2008»
14 years 9 months ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
EUROCRYPT
2003
Springer
15 years 2 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas
EUROCRYPT
2000
Springer
15 years 1 months ago
Efficient Proofs that a Committed Number Lies in an Interval
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...
Fabrice Boudot
ICDAR
2009
IEEE
14 years 7 months ago
Geometric Centroids and their Relative Distances for Off-line Signature Verification
In this paper, we propose a new approach for symbolic representation of off-line signatures based on relative distances between centroids useful for verification. Distances betwee...
H. N. Prakash, D. S. Guru
ASIACRYPT
2003
Springer
15 years 2 months ago
Accumulating Composites and Improved Group Signing
Constructing practical and provably secure group signature schemes has been a very active research topic in recent years. A group signature can be viewed as a digital signature wit...
Gene Tsudik, Shouhuai Xu