Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
From MaRDI portal
Publication:5738973
DOI10.1007/978-3-319-56614-6_6zbMath1415.94414OpenAlexW2601790081MaRDI QIDQ5738973
Elette Boyle, Yuval Ishai, Niv Gilboa
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_6
Related Items (22)
Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round MPC: information-theoretic and black-box ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Sublinear secure computation from new assumptions ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ A framework for statistically sender private OT with optimal rate ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Two Party Distribution Testing: Communication and Security ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Broadcast-optimal two-round MPC
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A derandomization using min-wise independent permutations
- A proof of security of Yao's protocol for two-party computation
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Computationally private randomizing polynomials and their applications
- A Small Approximately Min-Wise Independent Family of Hash Functions
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Mersenne Factorization Factory
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Function Secret Sharing
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Circular-Secure Encryption from Decision Diffie-Hellman
- Universally-Composable Two-Party Computation in Two Rounds
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Communication preserving protocols for secure function evaluation
- How to use indistinguishability obfuscation
- Functional Signatures and Pseudorandom Functions
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
This page was built for publication: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
