Separation Results on the “One-More” Computational Problems
Authors:
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 71-87
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log2005
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature SchemeJournal of Cryptology, 2003
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme2002
- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks2002
- Transitive Signature Schemes2002
- The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes2001
- How to go beyond the black-box simulation barrier2001
- Undeniable Signatures1990
- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory1988
- Random self-reducibility and zero knowledge interactive proofs of possession of information1987