Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
From MaRDI portal
Publication:2175948
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- A Framework for Efficient and Composable Oblivious Transfer
- Breaking the circuit size barrier for secure computation under DDH
- Compressible FHE with applications to PIR
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Faster Bootstrapping with Polynomial Error
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic secret sharing from lattices without FHE
- Homomorphic time-lock puzzles and applications
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- Lattice-based FHE as secure as PKE
- Maliciously circuit-private FHE
- Multi-identity and multi-key leveled FHE from learning with errors
- Obfuscation of probabilistic circuits and applications
- On lattices, learning with errors, random linear codes, and cryptography
- Packed ciphertexts in LWE-based homomorphic encryption
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Spooky Encryption and Its Applications
- Trapdoor hash functions and their applications
- Two round multiparty computation via multi-key FHE
- Two-message statistically sender-private OT from LWE
Cited in
(49)- Candidate iO from homomorphic encryption schemes
- Delay encryption
- Candidate obfuscation via oblivious LWE sampling
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Deniable fully homomorphic encryption from learning with errors
- 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
- 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
- Algebraic restriction codes and their applications
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Candidate iO from homomorphic encryption schemes
- 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
- Completeness theorems for adaptively secure broadcast
- A framework for statistically sender private OT with optimal rate
- Error correction and ciphertext quantization in lattice cryptography
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Compact selective opening security from LWE
- Lower bounds for lattice-based compact functional encryption
- Two-round maliciously-secure oblivious transfer with optimal rate
- Time-lock puzzles from lattices
- On sequential functions and fine-grained cryptography
- Linear-size Boolean circuits for multiselection
- Enhanced trapdoor hashing from DDH and DCR
- Black-box constant-round secure 2PC with succinct communication
- Simultaneous-message and succinct secure computation
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- How to construct public timeline for RSA-formed time-lock cryptography
- Key-homomorphic and aggregate verifiable random functions
- Chained time lock puzzle with small puzzle size
- Fully-homomorphic encryption from lattice isomorphism
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- Simultaneous-message and succinct secure computation: reusable and multiparty protocols
- Separating verifiable delay functions and time-lock puzzles
- Lower bounds on the overhead of indistinguishability obfuscation
- HQC beyond the standard: ciphertext compression and refined DFR analysis
- Towards practical transciphering for FHE with setup independent of the plaintext space
- Security definitions on time-lock puzzles
This page was built for publication: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175948)
