Secure Protocol Transformations

DOI10.1007/978-3-662-53008-5_15zbMath1372.94430OpenAlexW2495326230MaRDI QIDQ2829224

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

Mathematics Subject Classification ID

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

Related Items (12)

On the round complexity of black-box secure MPC ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ From fairness to full security in multiparty computation ⋮ On the exact round complexity of secure three-party computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On the power of secure two-party computation ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Power of Secure Two-Party Computation
• Secure Multi-Party Computation with Identifiable Abort
• Unconditionally-Secure Robust Secret Sharing with Compact Shares
• Must You Know the Code of f to Securely Compute f?
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• Systematizing Secure Computation for Research and Decision Support
• How to share a secret
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• An O (log n ) expected rounds randomized byzantine generals protocol
• Computing Algebraic Formulas Using a Constant Number of Registers
• The knowledge complexity of interactive proof-systems
• Foundations of Cryptography
• Circuits resilient to additive attacks with applications to secure computation
• 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
• Scalable Secure Multiparty Computation

This page was built for publication: Secure Protocol Transformations