Black-Box Constructions of Protocols for Secure Computation

DOI10.1137/100790537zbMath1236.94056OpenAlexW1983550066MaRDI QIDQ3020005

Yehuda Lindell, Yuval Ishai, Erez Petrank, Iftach Haitner, Eyal Kushilevitz

Publication date: 29 July 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100790537

zbMATH Keywords

oblivious transfersecure computationblack-box reductionstheory of cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (17)

On the round complexity of black-box secure MPC ⋮ Round-optimal black-box protocol compilers ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ On the feasibility of extending oblivious transfer ⋮ Black-box reusable NISC with random oracles ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Succinct arguments for RAM programs via projection codes ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Round-optimal black-box MPC in the plain model ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ What security can we achieve within 4 rounds? ⋮ Round-optimal secure multi-party computation ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ The price of active security in cryptographic protocols

This page was built for publication: Black-Box Constructions of Protocols for Secure Computation