Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences

Volumn 37, Issue 2, 1988, Pages 156-189

  Brassard, Gilles ^a   Chaum, David ^b   Crépeau, Claude ^c  

^a Succursale Centre Ville   (Canada)

^b CWI   (Netherlands)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000867507     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(88)90005-0     Document Type: Article

References (50)

1. Recognizing primes in random polynomial time
2. Trading group theory for randomness
3. Cryptographic capsules: A disjunctive primitive for interactive protocols
4. Aspects and importance of secure implementations of identification systems
5. An update on quantum cryptography
6. Quantum cryptography: Public-key distribution and coin-tossing
7. Coin flipping by telephone: A protocol for solving impossible problems
8. Coin flipping by telephone a protocol for solving impossible problems
9. A Discrete Logarithm Implementation of Zero-Knowledge Blobs
10. Zero-knowledge simulation of Boolean circuits
11. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
12. Information theoretic reductions among disclosure problems
13. All-or-nothing disclosure of secrets
14. Showing credentials without identification: Signatures transferred between unconditionally unlinkable pseudonyms
15. Security without identification: Transaction systems to make Big Brother obsolete
16. Showing satisfiability without revealing how
17. Demonstrating that a public predicate can be satisfied without revealing any information about how
18. Multiparty unconditionally secure protocols
19. Multiparty computations ensuring privacy of each party's input and correctness of the result
20. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations
21. Demonstrating prossession of a discrete logarithm without revealing it
22. The complexity of theorem proving procedures
23. Equivalence between two flavours of oblivious transfers
24. New directions in cryptography
25. Zero knowledge proofs of identity
26. The complexity of perfect zero-knowledge
27. A private interactive test of a Boolean predicate and minimum-knowledge public-key cryptosystems
28. Computational complexity of probabilistic Turing machines
29. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
30. Almost all primes can be quickly certified
31. Probabilistic encryption
32. The knowledge complexity of interactive proof-systems
33. Arthur-Merlin games versus interactive proof systems
34. Bringing home the atomic world Quantum mysteries for anybody
35. Games against nature
36. Simultaneous security of bits in the discrete log
37. A simple way to show the validity of your public key
38. Every prime has a succinct certificate
39. Probabilistic algorithms
40. Digitalized signatures
41. Digitalized Signatures and Public-Key Functions as Intractable as Factorization
42. How to Exchange Secrets by Oblivious Transfer
43. A mathematical theory of communication
44. A mathematical theory of communication
45. A fast Monte Carlo test for primality
46. Conjugate coding