Sciweavers

401 search results - page 3 / 81
» Delegatable Functional Signatures
Sort
View
JOC
2000
181views more  JOC 2000»
13 years 5 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
SIGOPS
1998
123views more  SIGOPS 1998»
13 years 5 months ago
A New Family of Authentication Protocols
Abstract. We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous...
Ross J. Anderson, Francesco Bergadano, Bruno Crisp...
ASIACRYPT
2011
Springer
12 years 5 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
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
SCN
2010
Springer
147views Communications» more  SCN 2010»
13 years 3 months ago
Group Message Authentication
Group signatures is a powerful primitive with many practical applications, allowing a group of parties to share a signature functionality, while protecting the anonymity of the si...
Bartosz Przydatek, Douglas Wikström