On instantiating the algebraic group model from falsifiable assumptions

DOI10.1007/978-3-030-45724-2_4zbMath1492.94054OpenAlexW3013111361MaRDI QIDQ2119007

Thomas Agrikola, Julia Kastner, Dennis Hofheinz

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_4

zbMATH Keywords

Schnorr signaturesindistinguishability obfuscationalgebraic group model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

One-more unforgeability of blind ECDSA ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ A classification of computational assumptions in the algebraic group model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programmable hash functions and their applications
• Efficient signature generation by smart cards
• Interactively secure groups from obfuscation
• Graded encoding schemes from obfuscation
• Short signatures from the Weil pairing
• The algebraic group model and its applications
• Complexity of a determinate algorithm for the discrete logarithm
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Dual-mode NIZKs from obfuscation
• On tight security proofs for Schnorr signatures
• Multilinear Maps from Obfuscation
• Targeted malleability
• Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
• Programmable Hash Functions in the Multilinear Setting
• Algorithms for Black-Box Fields and their Application to Cryptography
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• The Uber-Assumption Family
• Breaking RSA may not be equivalent to factoring
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Candidate Multilinear Maps from Ideal Lattices
• On the existence of extractable one-way functions
• Obfuscation of Probabilistic Circuits and Applications
• Advances in Cryptology – CRYPTO 2004
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
• Advances in Cryptology - CRYPTO 2003
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Cryptography and Coding

This page was built for publication: On instantiating the algebraic group model from falsifiable assumptions