Jan 1, 1991
· Journal of Cryptology 28 cites
Elliptic curve implementation of zero-knowledge blobs Neal Koblitz
No abstract is available for this record.
Open access
2 source records
Cryptography and Data Security
Cryptography and Residue Arithmetic
Coding theory and cryptography
Original source Jan 1, 1991
· Journal of Cryptology 45 cites
Practical zero-knowledge proofs: Giving hints and using deficiencies Joan Boyar, Katalin Friedl, Carsten Lund
No abstract is available for this record.
Open access
2 source records
Cryptography and Data Security
Cryptography and Residue Arithmetic
Complexity and Algorithms in Graphs
Original source Jan 1, 1990
· Lecture notes in computer science 101 cites
A Modification of the Fiat-Shamir Scheme Kazuo Ohta, Tatsuaki Okamoto
No abstract is available for this record.
Open access
Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptography and Residue Arithmetic
Original source Jan 1, 1990
· Lecture notes in computer science 28 cites
Zero-Knowledge Authentication Scheme with Secret Key Exchange Jørgen Brandt, Ivan Damgård, Peter Landrock, Torben Pedersen
No abstract is available for this record.
Open access
2 source records
Cryptography and Data Security
Chaos-based Image/Signal Encryption
Cryptography and Residue Arithmetic
Original source Jan 1, 1990
· Journal of Cryptology 77 cites
A discrete logarithm implementation of perfect zero-knowledge blobs Joan Boyar, Stuart A. Kurtz, Mark W. Krentel
No abstract is available for this record.
Open access
Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptography and Residue Arithmetic
Original source Jan 1, 1990
· Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 1,090 cites
Public-key cryptosystems provably secure against chosen ciphertext attacks Moni Naor, Moti Yung
We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before. A concrete implementation can be based on quadratic residuosity intractability.
Open access
Cryptography and Data Security
Cryptographic Implementations and Security
Cryptography and Residue Arithmetic
Original source Jan 1, 1988
· Lecture notes in computer science 14 cites
An Impersonation-Proof Identity Verification Scheme Gustavus J. Simmons
No abstract is available for this record.
Open access
Cryptography and Data Security
Cryptography and Residue Arithmetic
Advanced Authentication Protocols Security
Original source Jan 1, 1988
· Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 879 cites
Non-interactive zero-knowledge and its applications Manuel Blum, Paul Feldman, Silvio Micali
We show that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the first public-key cryptosystem secure against chosen ciphertext attack.
Open access
2 source records
Cryptography and Data Security
Cryptographic Implementations and Security
Cryptography and Residue Arithmetic
Original source