On the Equivalence of Generic Group Models

DOI10.1007/978-3-540-88733-1_14zbMath1204.94072OpenAlexW1509956264MaRDI QIDQ5505469

Jorg Schwenk, Tibor Jager

Publication date: 27 January 2009

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88733-1_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

On the multi-user security of short Schnorr signatures with preprocessing ⋮ On the security of functional encryption in the generic group model ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ How to obfuscate MPC inputs ⋮ To label, or not to label (in generic groups) ⋮ Generic-group delay functions require hidden-order groups ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another look at generic groups
• Advances in cryptology - ASIACRYPT 2000. 6th international conference on the Theory and application of cryptology and information security, Kyoto, Japan, December 3--7, 2000. Proceedings
• Complexity of a determinate algorithm for the discrete logarithm
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Generic groups, collision resistance, and ECDSA
• Algorithms for Black-Box Fields and their Application to Cryptography
• On Black-Box Ring Extraction and Integer Factorization
• New directions in cryptography
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• The Exact Security of ECIES in the Generic Group Model
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• Cryptography and Coding

This page was built for publication: On the Equivalence of Generic Group Models