Sciweavers

77 search results - page 2 / 16
» How to Achieve a McEliece-Based Digital Signature Scheme
Sort
View
FC
1998
Springer
134views Cryptology» more  FC 1998»
13 years 9 months ago
Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures. It is an extension o...
Anna Lysyanskaya, Zulfikar Ramzan
ISW
2004
Springer
13 years 10 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz
IJNSEC
2008
108views more  IJNSEC 2008»
13 years 4 months ago
Multiplicative Forward-Secure Threshold Signature Scheme
The devastating consequence of secret key exposure in digital signature is that any signature can be forged and cannot be trusted. To mitigate the damage of secret key exposure, f...
Sherman S. M. Chow, H. W. Go, Lucas Chi Kwong Hui,...
JOC
2000
181views more  JOC 2000»
13 years 4 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
FTDCS
2003
IEEE
13 years 10 months ago
Adopting Redundancy Techniques for Multicast Stream Authentication
Various schemes have been proposed to achieve strong authenticationof streamed data in a lossy network by means of “light” digital signatures. Such techniques perform a strong...
Tommaso Cucinotta, Gabriele Cecchetti, Gianluca Fe...