Sciweavers

77 search results - page 3 / 16
» How to Achieve a McEliece-Based Digital Signature Scheme
Sort
View
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
13 years 9 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
AINA
2004
IEEE
13 years 9 months ago
Generating Digital Signatures on Mobile Devices
With the explosion of the mobile communication market, more and more handheld devices act as clients in the Internet. People use these devices to purchase books, play games, recei...
Yu Lei, Deren Chen, Zhongding Jiang
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
13 years 11 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
ISN
1998
Springer
13 years 9 months ago
See What You Sign: Secure Implementations of Digital Signatures
An expectation of a signature system is that a signatory cannot dispute a signature. Aiming at this, the following questions arise: Can documents in electronic commerce on the Inte...
Arnd Weber
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 9 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert