On time-lock cryptographic assumptions in abelian hidden-order groups

DOI10.1007/978-3-030-92075-3_13MaRDI QIDQ6157523zbMATH OpenFDO

Authors Aron van Baarsen, Marc Stevens

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/31209

zbMATH Keywords

algebraic group modeltime-lock cryptographycryptographic abelian groupshidden order groups

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Finite abelian groups (20K01)

Recommendations

• Generic-group delay functions require hidden-order groups
• Cryptographic primitives based on groups on hidden order
• On the security of time-lock puzzles and timed commitments
• Time-release cryptography from minimal circuit assumptions
• Theory of Cryptography

Cites work

• scientific article; zbMATH DE number 3889661 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1303114 (Why is no real title available?)
• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• A key-exchange system based on imaginary quadratic fields
• A signature scheme based on the intractability of computing roots
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Binary quadratic forms. An algorithmic approach
• Complexity of a determinate algorithm for the discrete logarithm
• Computing the structure of a finite abelian group
• Continuous verifiable delay functions
• Efficient verifiable delay functions
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• 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
• Non-interactive cryptographic timestamping based on verifiable delay functions
• On the security of time-lock puzzles and timed commitments
• Proofs from THE BOOK
• Simple verifiable delay functions
• The algebraic group model and its applications
• Time- and space-efficient arguments from groups of unknown order
• Transaction protection by beacons
• Transparent SNARKs from DARK compilers
• Verifiable delay functions

Cited in

(2)

• Astrolabous: a universally composable time-lock encryption scheme
• Practical statistically-sound proofs of exponentiation in any group

This page was built for publication: On time-lock cryptographic assumptions in abelian hidden-order groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157523)