Generic-group delay functions require hidden-order groups

DOI10.1007/978-3-030-45727-3_6zbMath1479.94250OpenAlexW3013211702MaRDI QIDQ2055651

Lior Rotem, Gil Segev, Ido Shahaf

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_6

zbMATH Keywords

time-lock puzzleverifiable delay function

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Practical statistically-sound proofs of exponentiation in any group ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Time-release cryptography from minimal circuit assumptions ⋮ To label, or not to label (in generic groups) ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ On the impossibility of purely algebraic signatures ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ A note on Low Order assumptions in RSA groups

Cites Work

• Simple proofs of sequential work
• Verifiable delay functions
• Complexity of a determinate algorithm for the discrete logarithm
• Tight verifiable delay functions
• Verifiable delay functions from supersingular isogenies and pairings
• Time-Lock Puzzles from Randomized Encodings
• Publicly verifiable proofs of sequential work
• Algorithms for Black-Box Fields and their Application to Cryptography
• Simple verifiable delay functions
• Time-Lock Puzzles in the Random Oracle Model
• Separating succinct non-interactive arguments from all falsifiable assumptions
• On the Equivalence of Generic Group Models
• Cryptography and Coding
• Efficient verifiable delay functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic-group delay functions require hidden-order groups