On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Certified Digital SignaturePublished by Springer Nature ,2001
- On Interactive Proofs with a Laconic ProverPublished by Springer Nature ,2001
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- Checking the correctness of memoriesAlgorithmica, 1994
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- How to construct random functionsJournal of the ACM, 1986