Circuits resilient to additive attacks with applications to secure computation
From MaRDI portal
Publication:5259585
DOI10.1145/2591796.2591861zbMATH Open1315.94073OpenAlexW2133382302MaRDI QIDQ5259585FDOQ5259585
Authors: Daniel Genkin, Yuval Ishai, Manoj Prabhakaran, 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
Recommendations
- Binary AMD circuits from secure multiparty computation
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Securing circuits against constant-rate tampering
- Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
- Secure Arithmetic Computation with No Honest Majority
Cites Work
- Theory of Cryptography
- The geometry of differential privacy: the sparse and approximate cases
- 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
- Differential privacy and the fat-shattering dimension of linear queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the sample complexity for private learning and private data release
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately releasing conjunctions and the statistical query barrier
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (46)
- Continuously non-malleable codes in the split-state model
- Efficient, actively secure MPC with a dishonest majority: a survey
- Oblivious transfer with constant computational overhead
- Subversion-resilient signatures: definitions, constructions and applications
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Sequential Circuit Design for Embedded Cryptographic Applications Resilient to Adversarial Faults
- 3-party secure computation for RAMs: optimal and concretely efficient
- Efficiently testable circuits without conductivity
- On the communication required for unconditionally secure multiplication
- Round-optimal secure multi-party computation
- Fluid MPC: secure multiparty computation with dynamic participants
- Sublinear GMW-style compiler for MPC with preprocessing
- Unconditional communication-efficient MPC via Hall's marriage theorem
- MPC with delayed parties over star-like networks
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Binary AMD circuits from secure multiparty computation
- Overlaying conditional circuit clauses for secure computation
- Secure multiparty computation with sublinear preprocessing
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Secure protocol transformations
- Arithmetic sketching
- On linear communication complexity for (maximally) fluid MPC
- The price of active security in cryptographic protocols
- Leakage Resilient Cheating Detectable Secret Sharing Schemes
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Asymptotically quasi-optimal cryptography
- Going beyond dual execution: MPC for functions with efficient verification
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Guaranteed output delivery comes free in honest majority MPC
- The price of active security in cryptographic protocols
- Fast large-scale honest-majority MPC for malicious adversaries
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Non-interactive zero-knowledge proofs to multiple verifiers
- Scalable agreement protocols with optimal optimistic efficiency
- MPClan: protocol suite for privacy-conscious computations
- Constant-round asynchronous multi-party computation based on one-way functions
- Secure computation with low communication from cross-checking
- Bounded tamper resilience: how to go beyond the algebraic barrier
- High-throughput secure three-party computation with an honest majority
- Improved primitives for MPC over mixed arithmetic-binary circuits
- ATLAS: efficient and scalable MPC in the honest majority setting
- Trusted computing with addition machines. I
Uses Software
This page was built for publication: Circuits resilient to additive attacks with applications to secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259585)
