Sciweavers

262 search results - page 34 / 53
» Proposal of a Signature Scheme Based on STS Trapdoor
Sort
View
ASIACRYPT
2001
Springer
15 years 1 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
EUROPKI
2007
Springer
15 years 3 months ago
Undeniable Mobile Billing Schemes
An undeniable mobile billing system allows a mobile network service provider to bill its subscribers with trustworthy evidences. Chen, Jan and Chen proposed such a billing system b...
Shiqun Li, Guilin Wang, Jianying Zhou, Kefei Chen
76
Voted
ASIACRYPT
2010
Springer
14 years 7 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
FC
2001
Springer
123views Cryptology» more  FC 2001»
15 years 1 months ago
Optimistic Fair Exchange with Transparent Signature Recovery
In this paper, we propose a new practical fair exchange protocol allowing the exchange of an electronic item against a signature. The protocol is based on the Guillou-Quisquater s...
Olivier Markowitch, Shahrokh Saeednia
83
Voted
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
15 years 24 days ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...