Interactive Bi-Proof Systems and Undeniable Signature Schemes
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 243-256
- https://doi.org/10.1007/3-540-46416-6_21
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bit Commitment Using Pseudo-RandomnessPublished by Springer Nature ,2001
- Zero-Knowledge Undeniable Signatures (extended abstract)Published by Springer Nature ,1991
- Undeniable SignaturesPublished by Springer Nature ,1990
- Perfect zero-knowledge in constant roundsPublished by Association for Computing Machinery (ACM) ,1990
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero knowledge proofs of identityPublished by Association for Computing Machinery (ACM) ,1987
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- New directions in cryptographyIEEE Transactions on Information Theory, 1976