One-way functions are essential for non-trivial zero-knowledge
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- One-way functions, hard on average problems, and statistical zero-knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algebraic methods for interactive proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bit Commitment Using Pseudo-RandomnessPublished by Springer Nature ,2001
- IP = PSPACEJournal of the ACM, 1992
- One-way functions are necessary and sufficient for secure signaturesPublished by Association for Computing Machinery (ACM) ,1990
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Interactive proof systems: Provers that never fail and random selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Private coins versus public coins in interactive proof systemsPublished by Association for Computing Machinery (ACM) ,1986
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982