Black-box constructions of protocols for secure computation

DOI10.1137/100790537zbMATH Open1236.94056OpenAlexW1983550066MaRDI QIDQ3020005FDOQ3020005

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

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

Recommendations

• Black-box constructions for secure computation
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• Black-box constructions of bounded-concurrent secure computation
• Black-box constructions of composable protocols without set-up

zbMATH Keywords

oblivious transfersecure computationblack-box reductionstheory of cryptography

Mathematics Subject Classification ID

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

Cited In (32)

• On black-box complexity of universally composable security in the CRS model
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Black-box anonymous commit-and-prove
• Black-box constructions for secure computation
• Succinct arguments for RAM programs via projection codes
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
• Black-box reusable NISC with random oracles
• What security can we achieve within 4 rounds?
• Round-optimal secure multi-party computation
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Efficient non-interactive secure computation
• Must you know the code of \(f\) to securely compute \(f\)?
• Black-box constructions of composable protocols without set-up
• On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
• Title not available (Why is that?)
• On the round complexity of black-box secure MPC
• On the feasibility of extending oblivious transfer
• Round-optimal black-box protocol compilers
• What Security Can We Achieve Within 4 Rounds?
• Round-optimal black-box MPC in the plain model
• The price of active security in cryptographic protocols
• Bounds on the efficiency of black-box commitment schemes
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• The price of active security in cryptographic protocols
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
• Advances in Cryptology - EUROCRYPT 2004
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• Learning under \(p\)-tampering poisoning attacks
• Round-efficient black-box construction of composable multi-party computation
• A black-box construction of non-malleable encryption from semantically secure encryption

This page was built for publication: Black-box constructions of protocols for secure computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020005)