On sequential functions and fine-grained cryptography

DOI10.1007/978-3-031-68388-6_14MaRDI QIDQ6652975zbMATH OpenFDO

Authors Jiaxin Guan, Hart Montgomery

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68388-6_14

zbMATH Keywords

black-box oraclefine-grained symmetric key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Time-release cryptography from minimal circuit assumptions
• Lattice-based timed cryptography
• Fine-Grained Cryptography
• Continuous verifiable delay functions
• On the security of time-lock puzzles and timed commitments

Cites work

• Advances in Cryptology – CRYPTO 2004
• Anonymous whistleblowing over authenticated channels
• Average-case fine-grained hardness
• Computational Complexity
• Cryptography in NC^0
• Delay encryption
• Efficient verifiable delay functions
• Efficiently computing data-independent memory-hard functions
• Fine-Grained Cryptography
• Fine-grained cryptography revisited
• Fine-grained secure attribute-based encryption
• Fine-grained secure computation
• 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
• High Parallel Complexity Graphs and Memory-Hard Functions
• Homomorphic time-lock puzzles and applications
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Lower bounds on obfuscation from all-or-nothing encryption primitives
• Matching triangles and basing hardness on an extremely popular conjecture
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
• Modular exponentiation via the explicit Chinese remainder theorem
• Non-interactive zero-knowledge proofs with fine-grained security
• Nova: recursive zero-knowledge arguments from folding schemes
• On building fine-grained one-way functions from strong average-case hardness
• Pebbling and Proofs of Work
• Public-key cryptography in the fine-grained setting
• Publicly verifiable proofs of sequential work
• Simple proofs of sequential work
• Simple verifiable delay functions
• Theory of Cryptography
• Tight verifiable delay functions
• Time-lock puzzles from randomized encodings
• Time-release cryptography from minimal circuit assumptions
• To label, or not to label (in generic groups)
• Trustworthy public randomness with sloth, unicorn, and trx
• Uniform generation of NP-witnesses using an NP-oracle
• Verifiable delay functions
• Verifiable delay functions from supersingular isogenies and pairings

This page was built for publication: On sequential functions and fine-grained cryptography

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