Fastest 2PC in all the land

Slides:



Advertisements
Similar presentations
Polylogarithmic Private Approximations and Efficient Matching
Advertisements

Revisiting the efficiency of malicious two party computation David Woodruff MIT.
Quid-Pro-Quo-tocols Strengthening Semi-Honest Protocols with Dual Execution Yan Huang 1, Jonathan Katz 2, David Evans 1 1. University of Virginia 2. University.
Efficiency vs. Assumptions in Secure Computation Yuval Ishai Technion & UCLA.
Yan Huang, David Evans, Jonathan Katz
Oblivious Branching Program Evaluation
Rational Oblivious Transfer KARTIK NAYAK, XIONG FAN.
CS555Topic 241 Cryptography CS 555 Topic 24: Secure Function Evaluation.
On Fair Exchange, Fair Coins and Fair Sampling Shashank Agrawal, Manoj Prabhakaran University of Illinois at Urbana-Champaign.
Secure Computation on Mobile Devices Peter Chapman CS 1120 December 2, 2011.
1 Information complexity and exact communication bounds April 26, 2013 Mark Braverman Princeton University Based on joint work with Ankit Garg, Denis Pankratov,
Amortizing Garbled Circuits Yan Huang, Jonathan Katz, Alex Malozemoff (UMD) Vlad Kolesnikov (Bell Labs) Ranjit Kumaresan (Technion) Cut-and-Choose Yao-Based.
Introduction to Modern Cryptography, Lecture 12 Secure Multi-Party Computation.
Fine-grained Private Matching for Proximity-based Mobile Social Networking INFOCOM 2012 Rui Zhang, Yanchao Zhang Jinyuan (Stella) Sun Arizona State University.
GARBLED CIRCUITS & SECURE TWO-PARTY COMPUTATION
What Crypto Can Do for You: Solutions in Search of Problems Anna Lysyanskaya Brown University.
Yan Huang, Jonathan Katz, David Evans University of Maryland, University of Virginia Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung.
Symmetric Key Distribution Protocol with Hybrid Crypto Systems Tony Nguyen.
HOW TO PLAN A COUP D’ETAT COVERT MULTI-PARTY COMPUTATION YINMENG ZHANG ALADDIN REU 2005 LUIS VON AHN MANUEL BLUM.
1 Introduction to Secure Computation Benny Pinkas HP Labs, Princeton.
Authentication System
Dan Boneh Basic key exchange The Diffie-Hellman protocol Online Cryptography Course Dan Boneh.
Alexander Potapov.  Authentication definition  Protocol architectures  Cryptographic properties  Freshness  Types of attack on protocols  Two-way.
Adaptively Secure Broadcast, Revisited
Multi-Client Non-Interactive Verifiable Computation Seung Geol Choi (Columbia U.) Jonathan Katz (U. Maryland) Ranjit Kumaresan (Technion) Carlos Cid (Royal.
Secure Computation of the k’th Ranked Element Gagan Aggarwal Stanford University Joint work with Nina Mishra and Benny Pinkas, HP Labs.
Social Networking with Frientegrity: Privacy and Integrity with an Untrusted Provider Prateek Basavaraj April 9 th 2014.
Scaling Secure Computation Using the Cloud
Lecture 11: Strong Passwords
Slide 1 Vitaly Shmatikov CS 380S Yao’s Protocol. slide Yao’s Protocol uCompute any function securely … in the semi-honest model uFirst, convert.
Page 1 Efficient Two-Party Secure Computation on Committed Inputs Stanislaw Jarecki, UC Irvine Vitaly Shmatikov, UT Austin.
Secure two-party computation: a visual way by Paolo D’Arco and Roberto De Prisco.
TOWARDS PRACTICAL (GENERIC) ZERO-KNOWLEDGE Claudio Orlandi – Aarhus University.
Slide 1 Yao’s Protocol. slide Yao’s Protocol uCompute any function securely … in the semi-honest model uFirst, convert the function into a boolean.
Message Authentication Code July Message Authentication Problem  Message Authentication is concerned with:  protecting the integrity of a message.
Privacy-Preserving Credit Checking Keith Frikken, Mikhail Atallah, and Chen Zhang Purdue University June 7, 2005.
Practices in Security Bruhadeshwar Bezawada. Algorithms, Key Sizes and Strengths.
On the Communication Complexity of SFE with Long Output Daniel Wichs (Northeastern) joint work with Pavel Hubáček.
Lecture 2: Introduction to Cryptography
Hidden Access Control Policies with Hidden Credentials Keith Frikken, Mikhail Atallah, Jiangtao Li CERIAS and Department of Computer Sciences Purdue University.
Umans Complexity Theory Lectures Lecture 7b: Randomization in Communication Complexity.
IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.
Efficient Oblivious Transfer with Stateless Secure Tokens Alcatel-Lucent Bell Labs Vlad Kolesnikov.
Garbling Techniques David Evans
(More) Efficient Secure Computation from Garbled Circuits
The Exact Round Complexity of Secure Computation
Carmit Hazay (Bar-Ilan University, Israel)
THE NEED FOR ADDRESSING
MPC and Verifiable Computation on Committed Data
Foundations of Secure Computation
Internet internet.
Communication Complexity as a Lower Bound for Learning in Games
The first Few Slides stolen from Boaz Barak
Course Business I am traveling April 25-May 3rd
Cryptography CS 555 Lecture 22
Improved Private Set Intersection against Malicious Adversaries
IMAGE-BASED AUTHENTICATION
Effcient quantum protocols for XOR functions
إستراتيجيات ونماذج التقويم
Cryptography for Quantum Computers
Private Graph Algorithms in the Semi-Honest Model
Privacy Preserving analytics Private Set Intersection(PSI)
Multi-Party Computation: Second year
ورود اطلاعات بصورت غيربرخط
Radoslaw Jedynak, PhD Poland, Technical University of Radom
Efficient Short-Password Key Exchange (ESP-KE)
Malicious-Secure Private Set Intersection via Dual Execution
MPC Scenario 1. “Privacy-protected contingency tables”
Fast Secure Computation for Small Population over the Internet
Presentation transcript:

Fastest 2PC in all the land Batch Dual Execution Fastest 2PC in all the land Peter Rindal Mike Rosulek

Yao’s Protocol 𝑦 𝑥 𝑥 𝑦 Yao 𝑓(𝑥,𝑦)

Yao’s Protocol 𝑦 𝑥 𝑥 𝑦 Yao 𝑓(𝑥,𝑦) ⋅ Secure against Alice

Dual Execution 𝑥 𝑦 𝑦 𝑥 𝑓 𝑥,𝑦 𝐵 𝑦 𝑥 𝑓 𝑥,𝑦 𝐴 [MohasselFranklin06] Yao 𝑓 𝑥,𝑦 𝐵 Yao 𝑥 𝑦 𝑓 𝑥,𝑦 𝐴

Dual Execution 𝑥 𝑦 𝑦 𝑥 𝑓 𝑥,𝑦 𝐵 𝑦 𝑥 𝑓 𝑥,𝑦 𝐴 𝑓 𝑥,𝑦 𝐵 𝑓 𝑥,𝑦 𝐵 [MohasselFranklin06] 𝑥 𝑦 Yao 𝑦 𝑥 𝑓 𝑥,𝑦 𝐵 𝑦 𝑥 Yao 𝑓 𝑥,𝑦 𝐴 𝑓 𝑥,𝑦 𝐵 𝑓 𝑥,𝑦 𝐵 Eq? First Yao secure against Alice. Second Yao secure against Bob

Malicious secure. Leaks only a single bit! Dual Execution [MohasselFranklin06] 𝑥 𝑦 Yao 𝑔 ⋅ ,𝑦 𝑦 𝑥 𝑔 𝑥,𝑦 𝐵 𝑦 𝑥 Yao 𝑓 𝑥,𝑦 𝐴 𝑔 𝑥,𝑦 𝐵 𝑓 𝑥,𝑦 𝐵 Eq? First Yao secure against Alice. Second Yao secure against Bob Equality leaks 𝑔 𝑥,𝑦 =𝑓(𝑥,𝑦) Malicious secure. Leaks only a single bit!

Dual Execution 𝑥 𝑦 𝑦 𝑥 𝑦 𝑥 𝑧 1 𝐵 ,…, 𝑧 𝑛 𝐵 𝑧 1 𝐴 ,…, 𝑧 𝑛 𝐴 [KolesnikovMohasselRivaRosulek15] 𝑥 𝑦 Yao Yao Yao Yao 𝑦 𝑥 𝑦 Yao 𝑥 Yao Yao Yao 𝑧 1 𝐵 ,…, 𝑧 𝑛 𝐵 𝑧 1 𝐴 ,…, 𝑧 𝑛 𝐴 PSI

Dual Execution 𝑥 𝑦 𝑦 𝑥 𝑦 𝑥 𝑧 1 𝐵 ,…, 𝑧 𝑛 𝐵 𝑧 1 𝐴 ,…, 𝑧 𝑛 𝐴 [KolesnikovMohasselRivaRosulek15] 𝑥 𝑦 Yao Yao Yao Yao 𝑦 𝑥 𝑦 Yao 𝑥 Yao Yao Yao 𝑧 1 𝐵 ,…, 𝑧 𝑛 𝐵 𝑧 1 𝐴 ,…, 𝑧 𝑛 𝐴 PSI 𝐏𝐫 𝒍𝒆𝒂𝒌 𝒂 𝒃𝒊𝒕 = 𝟐 −𝒔 Equality leaks ∀ 𝑖 : 𝑔 𝑖 𝑥,𝑦 ≠𝑓(𝑥,𝑦)

Online – Offline [LindellRiva14,NeilsenOrlandi08] Want to execute 𝑓 many times Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao

Online – Offline [LindellRiva14,NeilsenOrlandi08] Want to execute 𝑓 many times Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao

Online – Offline [LindellRiva14,NeilsenOrlandi08] Want to execute 𝑓 many times Later we get inputs and evaluate Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao Yao PSI

Technical Challenges Input Consistency PSI reconciliation 𝑧 1 𝐵 Only 𝑂 𝑛 decommits and communication PSI reconciliation Very light weight malicious PSI Only weak security required Yao Yao Yao Yao 𝑧 1 𝐵 { 𝑧 1 𝐴 } PSI

Fastest in all the land * Running times for 1,024 evaluations To appear in Usenix ’16 Eprint coming soon Function Amortized Offline Online AES 5.1 𝑚𝑠 1.3 𝑚𝑠 SHA-256 48.0 𝑚𝑠 8.1 𝑚𝑠 “Faster Malicious 2-party Secure Computation with Online/Offline Dual Execution” * Online + Offline

The End Thanks Peter Rindal Mike Rosulek