Black-box constructions for secure computation
From MaRDI portal
Publication:2931374
DOI10.1145/1132516.1132531zbMath1301.94116OpenAlexW2069002101MaRDI QIDQ2931374
Eyal Kushilevitz, Erez Petrank, Yehuda Lindell, Yuval Ishai
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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items (16)
Round optimal black-box ``commit-and-prove ⋮ Best possible information-theoretic MPC ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ 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 ⋮ Semi-honest to Malicious Oblivious Transfer—The Black-Box Way ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
This page was built for publication: Black-box constructions for secure computation
