Breaking the circuit size barrier for secure computation under DDH
From MaRDI portal
Publication:2835599
Recommendations
- Homomorphic secret sharing from Paillier encryption
- Sublinear secure computation from new assumptions
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Secure multiparty computation with free branching
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
Cites work
- scientific article; zbMATH DE number 5485460 (Why is no real title available?)
- scientific article; zbMATH DE number 1559546 (Why is no real title available?)
- scientific article; zbMATH DE number 1754645 (Why is no real title available?)
- 3-query locally decodable codes of subexponential length
- A Depth-Universal Circuit
- Bootstrapping for HElib
- Circular-Secure Encryption from Decision Diffie-Hellman
- Communication optimal Tardos-based asymmetric fingerprinting
- Communication preserving protocols for secure function evaluation
- Distributed Point Functions and Their Applications
- Efficient fully homomorphic encryption from (standard) LWE
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Function secret sharing
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Linear-time encodable and decodable error-correcting codes
- Multi-identity and multi-key leveled FHE from learning with errors
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Number-theoretic constructions of efficient pseudo-random functions
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Parallel collision search with cryptanalytic applications
- Private Searching on Streaming Data
- Private information retrieval
- Spooky Encryption and Its Applications
- Theory of Cryptography
- Theory of Cryptography
- Two round multiparty computation via multi-key FHE
- Universal circuits (Preliminary Report)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Cited in
(59)- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Sublinear secure computation from new assumptions
- Sublinear-communication secure multiparty computation does not require FHE
- Low-complexity cryptographic hash functions
- A geometric approach to homomorphic secret sharing
- Function secret sharing for mixed-mode and fixed-point secure computation
- Combiners for functional encryption, unconditionally
- Amortizing rate-1 OT and applications to PIR and PSI
- Laconic private set intersection and applications
- A framework for statistically sender private OT with optimal rate
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- On homomorphic secret sharing from polynomial-modulus LWE
- Two-round MPC: information-theoretic and black-box
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- CNF-FSS and its applications
- Master-key KDM-secure IBE from pairings
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Compact NIZKs from standard assumptions on bilinear maps
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Non-interactive zero knowledge from sub-exponential DDH
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- On the local leakage resilience of linear secret sharing schemes
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- An algebraic framework for silent preprocessing with trustless setup and active security
- Homomorphic secret sharing from Paillier encryption
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Foundations of homomorphic secret sharing
- NIKE from affine determinant programs
- Adaptively secure MPC with sublinear communication complexity
- Efficient pseudorandom correlation generators from ring-LPN
- Homomorphic secret sharing for low degree polynomials
- Constrained pseudorandom functions from homomorphic secret sharing
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Large message homomorphic secret sharing from DCR and applications
- Evolving homomorphic secret sharing for hierarchical access structures
- Multi-client oblivious RAM with poly-logarithmic communication
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Multi-theorem preprocessing NIZKs from lattices
- Reusable two-round MPC from LPN
- Correlation intractability and SNARGs from sub-exponential DDH
- Two Party Distribution Testing: Communication and Security
- Batch-OT with optimal rate
- Highly efficient OT-based multiplication protocols
- Secure multiparty computation with free branching
- 10-party sublinear secure computation from standard assumptions
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- Laconic branching programs from the Diffie-Hellman assumption
- Rate-1 fully local somewhere extractable hashing from DDH
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Succinct homomorphic secret sharing
- Compact NIZKs from standard assumptions on bilinear maps
- Scooby: improved multi-party homomorphic secret sharing based on FHE
This page was built for publication: Breaking the circuit size barrier for secure computation under DDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835599)
