Simultaneous-message and succinct secure computation
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A minimal model for secure computation (extended abstract)
- Breaking the circuit size barrier for secure computation under DDH
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Compressible FHE with applications to PIR
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Fast public-key silent OT and more from constrained Naor-Reingold
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Foundations of homomorphic secret sharing
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Function secret sharing
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic secret sharing from lattices without FHE
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from well-founded assumptions
- Laconic function evaluation and applications
- Laconic oblivious transfer and its applications
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- New realizations of somewhere statistically binding hashing and positional accumulators
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On the communication complexity of secure function evaluation with long output
- Predicate encryption for circuits from LWE
- QuietOT: lightweight oblivious transfer with a public-key setup
- Secure arithmetic computation with constant computational overhead
- Secure computation on the web: computing without simultaneous interaction
- Simultaneous-message and succinct secure computation
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Spooky Encryption and Its Applications
- Succinct homomorphic secret sharing
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Trapdoor hash functions and their applications
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two-round multiparty secure computation from minimal assumptions
Cited in
(5)- Simultaneous-message and succinct secure computation
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- SNARK lower bounds via communication complexity
- Obfuscating pseudorandom functions is post-quantum complete
- Simultaneous-message and succinct secure computation: reusable and multiparty protocols
This page was built for publication: Simultaneous-message and succinct secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891256)
