Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
From MaRDI portal
Publication:2175948
DOI10.1007/978-3-030-36033-7_16zbMath1455.94132OpenAlexW2989630101MaRDI QIDQ2175948
Zvika Brakerski, Sanjam Garg, Nico Döttling, Giulio Malavolta
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_16
Related Items (28)
Deniable fully homomorphic encryption from learning with errors ⋮ Security definitions on time-lock puzzles ⋮ Multi-instance publicly verifiable time-lock puzzle and its applications ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Asymptotically quasi-optimal cryptography ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Batch-OT with optimal rate ⋮ Compressible FHE with applications to PIR ⋮ Algebraic restriction codes and their applications ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Completeness theorems for adaptively secure broadcast ⋮ A framework for statistically sender private OT with optimal rate ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate iO from homomorphic encryption schemes ⋮ Delay encryption ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Cites Work
- Unnamed Item
- Unnamed Item
- Two-message statistically sender-private OT from LWE
- Compressible FHE with applications to PIR
- Homomorphic time-lock puzzles and applications
- Homomorphic secret sharing from lattices without FHE
- Trapdoor hash functions and their applications
- (Leveled) fully homomorphic encryption without bootstrapping
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Maliciously Circuit-Private FHE
- Lattice-based FHE as secure as PKE
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Fully Homomorphic Encryption over the Integers
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- A Framework for Efficient and Composable Oblivious Transfer
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Pseudorandomness of ring-LWE for any ring and modulus
- Fully homomorphic encryption using ideal lattices
- Obfuscation of Probabilistic Circuits and Applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
