Convertible Undeniable Signatures
- 18 May 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 189-205
- https://doi.org/10.1007/3-540-38424-3_14
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bit Commitment Using Pseudo-RandomnessPublished by Springer Science and Business Media LLC ,2001
- One-way functions are necessary and sufficient for secure signaturesPublished by Association for Computing Machinery (ACM) ,1990
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- One-way functions are essential for complexity based cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Direct Minimum-Knowledge Computations (Extended Abstract)Lecture Notes in Computer Science, 1988
- Advances in Cryptology — EUROCRYPT ’87Published by Springer Science and Business Media LLC ,1988
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986