Sometimes-decryptable homomorphic encryption from sub-exponential DDH
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Breaking the circuit size barrier for secure computation under DDH
- Correlation intractability and SNARGs from sub-exponential DDH
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Fiat-Shamir: from practice to theory
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- From obfuscation to the security of Fiat-Shamir for proofs
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to delegate computations publicly
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation via mathematical proofs of equivalence
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Obfuscation of probabilistic circuits and applications
- On the communication complexity of secure function evaluation with long output
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Parallelizable delegation from LWE
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for monotone policy batch NP
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Statistical witness indistinguishability (and more) in two messages
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- The random oracle methodology, revisited.
- Theory of Cryptography
- Transparent error correcting in a computationally bounded world
- Trapdoor hash functions and their applications
This page was built for publication: Sometimes-decryptable homomorphic encryption from sub-exponential DDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863926)
