|
148
|
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
– Niko Baric, Birgit Pfitzmann
- 1997
|
|
233
|
Protocols for Public Key Cryptosystems
– R C Merkle
- 1980
|
|
1130
|
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
– Mihir Bellare, Phillip Rogaway
- 1995
|
|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
128
|
Certificate Revocation and Certificate Update
– Moni Naor, Kobbi Nissim
- 1998
|
|
185
|
How to Time-stamp a Digital Document
– Stuart Haber, W. Scott Stornetta
- 1991
|
|
53
|
Time-stamping with Binary Linking Schemes
– Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson
- 1998
|
|
2506
|
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
- 1978
|
|
961
|
A public key cryptosystem and a signature scheme based on discrete logarithms
– T ElGamal
- 1985
|
|
63
|
Efficient and Generalized Group Signatures
– Jan Camenisch
- 1997
|
|
8
|
Efficient Accumulators Without Trapdoor
– Tomas Sander
- 1999
|
|
231
|
A design principle for hash functions
– I Damgård
- 1989
|
|
267
|
A certified digital signature
– R C Merkle
- 1989
|
|
83
|
On Certificate Revocation and Validation
– P Kocher
- 1998
|
|
38
|
Fast digital identity revocation
– W Aiello, S Lodha, R Ostrovsky
- 1998
|
|
209
|
A practical and provably secure coalition-resistant group signature scheme
– Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
- 2000
|
|
1001
|
Probabilistic encryption
– S Goldwasser, S Micali
- 1984
|
|
106
|
Secure hash-and-sign signatures without the random oracle
– Rosario Gennaro, Shai Halevi, Tal Rabin
- 1999
|
|
123
|
Dynamic Perfect Hashing: Upper and Lower Bounds
– Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert E. Tarjan
- 1990
|
