Black-box constructions for secure computation

DOI10.1145/1132516.1132531MaRDI QIDQ2931374zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

black-box reductionscryptographyoblivious transfersecure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Black-box constructions of protocols for secure computation
• Black-box constructions of bounded-concurrent secure computation
• Must you know the code of f to securely compute f?
• Efficient non-interactive secure computation
• Black-box constructions of composable protocols without set-up

Cited in

(29)

• Round optimal black-box ``commit-and-prove
• Best possible information-theoretic MPC
• Round-efficient black-box construction of composable multi-party computation
• A black-box construction of non-malleable encryption from semantically secure encryption
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• Black-box constructions of bounded-concurrent secure computation
• Towards a unified approach to black-box constructions of zero-knowledge proofs
• On black-box complexity of universally composable security in the CRS model
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Must you know the code of f to securely compute f?
• Efficient non-interactive secure computation
• Black-box constructions of protocols for secure computation
• Weak oblivious transfer from strong one-way functions
• Secure multiparty RAM computation in constant rounds
• scientific article; zbMATH DE number 1418320 (Why is no real title available?)
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Advances in Cryptology - EUROCRYPT 2004
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• On the power of public-key encryption in secure computation
• Theory of Cryptography
• Minicrypt primitives with algebraic structure and applications
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Classically verifiable NIZK for QMA with preprocessing
• Improved black-box constructions of composable secure computation
• The round complexity of black-box post-quantum secure computation
• Black-box timed commitments from time-lock puzzles
• Constant-round adaptive zero-knowledge proofs for NP

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)