Circuits resilient to additive attacks with applications to secure computation
From MaRDI portal
Publication:5259585
DOI10.1145/2591796.2591861zbMath1315.94073OpenAlexW2133382302MaRDI QIDQ5259585
Manoj Prabhakaran, Daniel Genkin, Yuval Ishai, Amit Sahai, Eran Tromer
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591861
Related Items (35)
Fluid MPC: secure multiparty computation with dynamic participants ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Asymptotically quasi-optimal cryptography ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ High-throughput secure three-party computation with an honest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Oblivious transfer with constant computational overhead ⋮ Arithmetic sketching ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Secure computation with low communication from cross-checking ⋮ Continuously non-malleable codes in the split-state model ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Round-optimal secure multi-party computation ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Secure Protocol Transformations ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ The price of active security in cryptographic protocols
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Circuits resilient to additive attacks with applications to secure computation
