Separation results on the "one-more" computational problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4964 LNCS, Issue , 2008, Pages 71-87

  Bresson, Emmanuel ^a   Monnerat, Jean ^b   Vergnaud, Damien ^c  

^a DCSSI Crypto Lab   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

"One more" problems; Algebraic algorithms; Black box reductions; Random self reducible problems

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY OF DATA;

ALGEBRAIC ALGORITHMS; BLACK-BOX REDUCTIONS; PROOF OF SECURITY; RANDOM SELF-REDUCIBLE PROBLEMS;

CRYPTOGRAPHY;

EID: 43149115190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79263-5_5     Document Type: Conference Paper

References (18)

1. Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: FOCS 2001, pp. 106-115 (2001)
2. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The 1-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. J. Crypto 16, 185-215
3. Bellare, M., Neven, G.: Transitive Signatures: New Proofs and Schemes. IEEE IT 51(6), 2133-2151
4. Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162-177. Springer, Heidelberg (2002)
5. Bellare, M., Sandhu, R.: The Security of Practical Two-Party RSA Signature Schemes, http://eprint.iacr.org/2001/060
6. Boldyreva, A.: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31-46. Springer, Heidelberg (2002)
7. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. J. Crypto 17(4), 297-319
8. Brown, D.: Irreducibility to the One-More Evaluation Problems: More May Be Less, http://eprint.iacr.org/2007/435
9. Brown, D., Gallant, R.: The Static Diffie-Hellman Problem, http://eprint.iacr.org/2004/306
10. Chaum, D.: Blind Signatures for Untraceable Payments. In: CRYPTO 1982, pp. 199-203 (1982)
11. Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212-216. Springer, Heidelberg (1990)
12. Guillou, L.C., Quisquater, J.-J.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 123-128. Springer, Heidelberg (1988)
13. Micali, S., Rivest, R.L.: Transitive Signature Schemes. In: CT-RSA 2002, pp. 236-243 (2002)
14. Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: PKC 2001, pp. 104-118 (2001)
15. Paillier, P., Vergnaud, D.: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 1-20. Springer, Heidelberg (2005)
16. Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. J. Crypto (3), 361-396
17. Schnorr, C.-P.: Efficient Signature Generation by Smart Cards. J. Crypto (3), 161-174
18. Tompa, M., Woll, H.: Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. In: FOCS 1987, pp. 472-482 (1987)