Lower bounds on random-self-reducibility
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 100-109
- https://doi.org/10.1109/sct.1990.113959
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Self-testing/correcting with applications to numerical problemsPublished by Association for Computing Machinery (ACM) ,1990
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, 1989
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchyJournal of Computer and System Sciences, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Random self-reducibility and zero knowledge interactive proofs of possession of informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983