Secure protocol transformations

DOI10.1007/978-3-662-53008-5_15zbMATH Open1372.94430OpenAlexW2495326230MaRDI QIDQ2829224FDOQ2829224

Amit Sahai, Yuval Ishai, Manoj Prabhakaran, Eyal Kushilevitz, Ching-Hua Yu

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_15

Recommendations

• Founding Cryptography on Oblivious Transfer – Efficiently
• From fairness to full security in multiparty computation
• From fairness to full security in multiparty computation
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation

Mathematics Subject Classification ID

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

Cites Work

• How to share a secret
• Computing Algebraic Formulas Using a Constant Number of Registers
• The knowledge complexity of interactive proof-systems
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Title not available (Why is that?)
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Circuits resilient to additive attacks with applications to secure computation
• Title not available (Why is that?)
• Scalable Secure Multiparty Computation
• Unconditionally-Secure Robust Secret Sharing with Compact Shares
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• An O (log n ) expected rounds randomized byzantine generals protocol
• Title not available (Why is that?)
• On the Power of Secure Two-Party Computation
• Must You Know the Code of f to Securely Compute f?
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• Secure Multi-Party Computation with Identifiable Abort
• Systematizing Secure Computation for Research and Decision Support

Cited In (19)

• Beyond honest majority: the round complexity of fair and robust multi-party computation
• On actively-secure elementary MPC reductions
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• On the exact round complexity of secure three-party computation
• On the round complexity of black-box secure MPC
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• On fully-secure honest majority MPC without \(n^2\) round overhead
• On the Power of Secure Two-Party Computation
• Guaranteed output delivery comes free in honest majority MPC
• The price of active security in cryptographic protocols
• On the Computational Overhead of MPC with Dishonest Majority
• Sound Security Protocol Transformations
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
• Transforming password protocols to compose
• Efficient fully secure computation via distributed zero-knowledge proofs
• On the power of secure two-party computation
• From fairness to full security in multiparty computation
• On the exact round complexity of best-of-both-worlds multi-party computation
• Founding Cryptography on Oblivious Transfer – Efficiently

This page was built for publication: Secure protocol transformations

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