The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A framework for the study of cryptographic protocols
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
Demonstrating that a public predicate can be satisfied without revealing any information about how
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
A perfect zero-knowledge proof for a problem equivalent to discrete logarithm
CRYPTO '88 Proceedings on Advances in cryptology
An interactive identification scheme based on discrete logarithms and factoring (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Making conditionally secure cryptosystems unconditionally abuse-free in a general context
CRYPTO '89 Proceedings on Advances in cryptology
Towards practical “proven secure” authenticated key distribution
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Achieving Rights Untransferability with Client-Independent Servers
Designs, Codes and Cryptography
Strong loss tolerance of electronic coin systems
ACM Transactions on Computer Systems (TOCS)
A General Zero-Knowledge Scheme
Designs, Codes and Cryptography
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Simple and Secure Way to Show the Validity of Your Public Key
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Emerging Standards for Public-Key Cryptography
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications
ISC '02 Proceedings of the 5th International Conference on Information Security
A New type of ``Magic Ink'' Signatures - Towards Transcript-Irrelevant Anonymity Revocation
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Payment technologies for E-commerce
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
Practical private data matching deterrent to spoofing attacks
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Online subscriptions with anonymous access
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The Power of Anonymous Veto in Public Discussion
Transactions on Computational Science IV
A secure elliptic curve-based RFID protocol
Journal of Computer Science and Technology
Deterring voluntary trace disclosure in re-encryption mix-networks
ACM Transactions on Information and System Security (TISSEC)
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Blinding for unanticipated signatures
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Research of atomic and anonymous electronic commerce protocol
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Improved conditional e-payments
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Secure electronic bills of lading: blind counts and digital signatures
Electronic Commerce Research
Algebraic construction for zero-knowledge sets
Journal of Computer Science and Technology
How to protect a signature from being shown to a third party
TrustBus'06 Proceedings of the Third international conference on Trust, Privacy, and Security in Digital Business
Algorithm for proving the knowledge of an independent vertex set
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Security properties of two authenticated conference key agreement protocols
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Selectively traceable anonymity
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Cryptanalysis of an efficient proof of knowledge of discrete logarithm
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Improving efficiency of an ‘on the fly' identification scheme by perfecting zero-knowledgeness
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Attacking and fixing Helios: An analysis of ballot secrecy
Journal of Computer Security
| Hi-index | 0.00 |
Techniques are presented that allow A to convince B that she knows a solution to the Discrete Log Problem--i.e. that she knows an x such that 驴x 驴 脽 (mod N) holds--without revealing anything about x to B. Protocols are given both for N prime and for N composite. We prove these protocols secure under a formal model which is of interest in its own right. We also show how A can convince B that two elements 驴 and 脽 generate the same subgroup in ZN*, without revealing how to express either as a power of the other.