|
27
|
A simple and secure way to show the validity of your public key
– J van de Graaf, R Peralta
- 1987
|
|
512
|
Efficient signature generation for smart cards
– C P Schnorr
- 1991
|
|
1404
|
How to leak a secret
– Ronald L. Rivest, Adi Shamir, Yael Tauman
- 2001
|
|
298
|
Non-interactive and information-theoretic secure verifiable secret sharing
– T P Pedersen
- 1998
|
|
99
|
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
– Jan Camenisch, Markus Michels
- 1998
|
|
23
|
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products
– Rosario Gennaro, Daniele Micciancio, Tal Rabin
|
|
54
|
Practical and provably secure release of a secret and exchange of signatures
– I DamgËšard
- 1995
|
|
118
|
T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
– E Fujisaki, Okamoto
- 1997
|
|
267
|
Wallet databases with observers
– D Chaum, T Pedersen
- 1993
|
|
893
|
The knowledge complexity of interactive proof systems
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
7
|
A Statistical Limited-Knowledge Proof For Secure Rsa Keys
– Moses Liskov, Robert D. Silverman
- 1998
|
|
72
|
Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information
– M Tompa, H Woll
- 1987
|
|
2507
|
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
- 1978
|
|
1130
|
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
– Mihir Bellare, Phillip Rogaway
- 1995
|
|
961
|
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm
– T ElGamal
- 1985
|
|
80
|
The Complexity of Perfect Zero-Knowledge
– Lance Fortnow
- 1987
|
|
760
|
A Course in Computational Algebraic Number Theory
– H Cohen
- 1993
|
|
27
|
Convertible group signatures
– S Kim, S Park, D Won
|
|
10
|
Cryptanalysis in Prime Order Subgroups of
– Wenbo Mao, Filton Road
|
