Minimum Disclosure Proofs of Knowledge

[1]  Lance Fortnow,et al.  The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.

[2]  Gilles Brassard,et al.  Algorithmics - theory and practice , 1988 .

[3]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[4]  David Chaum,et al.  Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.

[5]  Claude Crépeau,et al.  Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.

[6]  David Chaum,et al.  An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.

[7]  Stuart A. Kurtz,et al.  A discrete logarithm implementation of zero-knowledge blobs , 1987 .

[8]  Leonard M. Adleman,et al.  Recognizing primes in random polynomial time , 1987, STOC.

[9]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[10]  Gilles Brassard,et al.  Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Gilles Brassard,et al.  Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[13]  David Chaum,et al.  Demonstrating Possession of a Discrete Logarithm Without Revealing It , 1986, CRYPTO.

[14]  Josh Benaloh,et al.  Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols , 1986, CRYPTO.

[15]  David Chaum,et al.  Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.

[16]  Gilles Brassard,et al.  All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.

[17]  Gilles Brassard,et al.  Zero-Knowledge Simulation of Boolean Circuits , 1986, CRYPTO.

[18]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[19]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[20]  Moti Yung,et al.  A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[22]  David Chaum,et al.  Showing Credentials Without Identification: SIgnatures Transferred Between Unconditionally Unlinkable Pseudonyms , 1985, EUROCRYPT.

[23]  Moti Yung,et al.  A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems Extended Abstract , 1985, FOCS 1985.

[24]  René Peralta,et al.  Simultaneous Security of Bits in the Discrete Log , 1985, EUROCRYPT.

[25]  Gilles Brassard,et al.  An Update on Quantum Cryptography , 1985, CRYPTO.

[26]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[27]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[29]  Manuel Blum,et al.  Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.

[30]  N. Mermin.  Bringing Home the Atomic World: Quantum Mysteries for Anybody. , 1981 .

[31]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[32]  Richard J. Lipton,et al.  Foundations of Secure Computation , 1978 .

[33]  Michael O. Rabin,et al.  In Foundations of secure computation , 1978 .

[34]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[35]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[36]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[37]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[38]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[39]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[40]  Claude E. Shannon,et al.  The mathematical theory of communication , 1950 .

[41]  Albert Einstein,et al.  Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .