Breaking the Circuit Size Barrier for Secure Computation Under DDH

DOI10.1007/978-3-662-53018-4_19zbMath1384.94038OpenAlexW2489433463MaRDI QIDQ2835599

Niv Gilboa, Yuval Ishai, Elette Boyle

Publication date: 30 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_19

zbMATH Keywords

2-out-of-2 secret sharing schemedecisional Diffie-Hellman (DDH) assumption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (49)

Master-Key KDM-Secure IBE from Pairings ⋮ Evolving homomorphic secret sharing for hierarchical access structures ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ Two-round MPC: information-theoretic and black-box ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Highly efficient OT-based multiplication protocols ⋮ Secure multiparty computation with free branching ⋮ Batch-OT with optimal rate ⋮ Reusable Two-Round MPC from LPN ⋮ CNF-FSS and Its Applications ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Sublinear secure computation from new assumptions ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ A framework for statistically sender private OT with optimal rate ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Laconic private set intersection and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ NIKE from affine determinant programs ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Combiners for functional encryption, unconditionally ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ A geometric approach to homomorphic secret sharing ⋮ Two Party Distribution Testing: Communication and Security ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Unnamed Item

Uses Software

• HElib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Parallel collision search with cryptanalytic applications
• Communication Optimal Tardos-Based Asymmetric Fingerprinting
• Spooky Encryption and Its Applications
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Bootstrapping for HElib
• Function Secret Sharing
• Linear-time encodable and decodable error-correcting codes
• Private information retrieval
• Number-theoretic constructions of efficient pseudo-random functions
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Fully Homomorphic Encryption over the Integers
• Evaluating Branching Programs on Encrypted Data
• Circular-Secure Encryption from Decision Diffie-Hellman
• A Depth-Universal Circuit
• Universal circuits (Preliminary Report)
• 3-query locally decodable codes of subexponential length
• Fully homomorphic encryption using ideal lattices
• Communication preserving protocols for secure function evaluation
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Distributed Point Functions and Their Applications
• Private Searching on Streaming Data
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• Theory of Cryptography
• Theory of Cryptography
• Two Round Multiparty Computation via Multi-key FHE

This page was built for publication: Breaking the Circuit Size Barrier for Secure Computation Under DDH