Secure protocol transformations

DOI10.1007/978-3-662-53008-5_15MaRDI QIDQ2829224zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, 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

Mathematics Subject Classification ID

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

Recommendations

• Founding Cryptography on Oblivious Transfer – Efficiently
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1304080 (Why is no real title available?)
• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• An O (log n ) expected rounds randomized byzantine generals protocol
• Circuits resilient to additive attacks with applications to secure computation
• Computing Algebraic Formulas Using a Constant Number of Registers
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• How to share a secret
• Must you know the code of \(f\) to securely compute \(f\)?
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On the Power of Secure Two-Party Computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable Secure Multiparty Computation
• Secure Arithmetic Computation with No Honest Majority
• Secure multi-party computation with identifiable abort
• Systematizing secure computation for research and decision support
• The knowledge complexity of interactive proof-systems
• Unconditionally-secure robust secret sharing with compact shares
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

Cited in

(18)

• Founding Cryptography on Oblivious Transfer – Efficiently
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• On actively-secure elementary MPC reductions
• On the exact round complexity of secure three-party computation
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• 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
• Sound Security Protocol Transformations
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
• Efficient fully secure computation via distributed zero-knowledge proofs
• Transforming password protocols to compose
• On the power of secure two-party computation
• On the exact round complexity of best-of-both-worlds multi-party computation
• On the computational overhead of MPC with dishonest majority

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)