On sequential functions and fine-grained cryptography
From MaRDI portal
Publication:6652975
DOI10.1007/978-3-031-68388-6_14MaRDI QIDQ6652975
Publication date: 13 December 2024
Cites Work
- Trustworthy public randomness with sloth, unicorn, and trx
- Fine-grained secure computation
- Simple proofs of sequential work
- Verifiable delay functions
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Uniform generation of NP-witnesses using an NP-oracle
- Generic-group delay functions require hidden-order groups
- Delay encryption
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Tight verifiable delay functions
- Fine-grained secure attribute-based encryption
- Non-interactive zero-knowledge proofs with fine-grained security
- On building fine-grained one-way functions from strong average-case hardness
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Homomorphic time-lock puzzles and applications
- Verifiable delay functions from supersingular isogenies and pairings
- Public-key cryptography in the fine-grained setting
- Time-lock puzzles from randomized encodings
- Efficiently Computing Data-Independent Memory-Hard Functions
- Fine-Grained Cryptography
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- High Parallel Complexity Graphs and Memory-Hard Functions
- Publicly verifiable proofs of sequential work
- 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
- Average-case fine-grained hardness
- Simple verifiable delay functions
- Advances in Cryptology – CRYPTO 2004
- Computational Complexity
- Pebbling and Proofs of Work
- Cryptography in $NC^0$
- Theory of Cryptography
- Fine-grained cryptography revisited
- Efficient verifiable delay functions
- Time-release cryptography from minimal circuit assumptions
- To label, or not to label (in generic groups)
- Nova: recursive zero-knowledge arguments from folding schemes
- Anonymous whistleblowing over authenticated channels
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)
