Black-box constructions for secure computation
DOI10.1145/1132516.1132531zbMATH Open1301.94116OpenAlexW2069002101MaRDI QIDQ2931374FDOQ2931374
Authors: Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank 
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132531
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Cited In (25)
- Black-box constructions of protocols for secure computation
- On black-box complexity of universally composable security in the CRS model
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Black-box constructions of bounded-concurrent secure computation
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Minicrypt primitives with algebraic structure and applications
- Round optimal black-box ``commit-and-prove
- Best possible information-theoretic MPC
- Efficient non-interactive secure computation
- Must you know the code of \(f\) to securely compute \(f\)?
- Title not available (Why is that?)
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Advances in Cryptology - EUROCRYPT 2004
- Secure Multiparty RAM Computation in Constant Rounds
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
- On the power of public-key encryption in secure computation
- Weak oblivious transfer from strong one-way functions
- Constant-round adaptive zero-knowledge proofs for NP
- Theory of Cryptography
- Round-efficient black-box construction of composable multi-party computation
- Classically verifiable NIZK for QMA with preprocessing
- A black-box construction of non-malleable encryption from semantically secure encryption
This page was built for publication: Black-box constructions for secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931374)
