mpc-header-hero

MPC Labs

Multi-party Computation (MPC) has the potential to enable real data privacy — especially as data has become a valuable commodity in and of itself. Unbound is at the forefront of MPC research, and how MPC can enable scalable, private, and secure data processing and sharing.

Overview

Cryptographers first developed Multi-Party Computation in the 1980s as a way to allow mutually distrustful parties to perform a joint computation on their individual inputs without having to reveal their data to one another.

Unbound co-founders Prof. Yehuda Lindell and Prof. Nigel Smart are regarded to be among the world’s top minds in Multi-Party Computation. They created Unbound to capitalize on the strength of MPC and to form disruptive software solutions that pose powerful alternatives to hardware for protecting secrets and enabling trust-contingent scenarios.

About the Authors

Daniel Harel
  • Daniel Harel
    Member of the Board
James Hayward
  • James Hayward
    Member of the Board
Guy Peer
  • Guy Peer
    VP R&D, co-founder
Ohad Finkelstein
  • Ohad Finkelstein
    Member of the Board
Prof. Yehuda Lindell
  • Prof. Yehuda Lindell
Nigel Smart
  • Nigel P. Smart
  • Michael Kraitsberg
  • Valery Osheter
  • Alex Presman
  • Oz Mishli
  • George Wainblat
  • Samuel Ranellucci

All Documents

Survey Papers by Co-Founders
Daniel Harel, James Hayward
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody
In the 25th ACM CCS, pages 1837-1854, 2018. The full version of this paper, with optimizations, is co-authored with Samuel Ranellucci.
Survey Papers by Co-Founders
James Hayward
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries.
In CRYPTO 2018, Springer (LNCS 10992), pages 331-361, 2018.
Survey Papers by Co-Founders
Ohad Finkelstein
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme
In the 24th Australasian Conference on Information Security and Privacy (ACISP), pages 192-210, 2019.
Survey Papers by Co-Founders
Daniel Harel, James Hayward
From Keys to Databases
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. The Computer Journal 61(12):1749-1771, 2018.
Survey Papers by Co-Founders
James Hayward
Tutorials on the Foundations of Cryptography (Dedicated to Oded Goldreich)
Series on Information Security and Cryptography, Springer, 2017.
Survey Papers by Co-Founders
Guy Peer
Introduction to Modern Cryptography, 2nd Edition
Chapman and Hall/CRC Press, November 2014.
Survey Papers by Co-Founders
Ohad Finkelstein
11th International Conference on the Theory of Cryptography
Lecture Notes in Computer Science, Volume 8349, Springer, 2014.
Survey Papers by Co-Founders
Daniel Harel
Efficient Secure Two-Party Protocols: Techniques and Constructions
Information Security and Cryptography Series, Springer-Verlag, 2010.
Survey Papers by Co-Founders
Ohad Finkelstein
Introduction to Modern Cryptography
Chapman and Hall/CRC Press, August 2007.
Survey Papers by Co-Founders
Guy Peer, Valery Osheter
Composition of Secure Multi-Party Protocols - A Comprehensive Study
Lecture Notes in Computer Science, Volume 2815, Springer-Verlag, 2003. Abstract
Survey Papers by Co-Founders
Prof. Yehuda Lindell
Efficient Scalable Constant-Round MPC via Garbled Circuits.
A. Ben-Efraim, Y. Lindell and E. Omri.
In ASIACRYPT 2017, Springer (LNCS 10625), pages 471-498, 2017.
Survey Papers by Co-Founders
Prof. Yehuda Lindell
How To Simulate It - A Tutorial on the Simulation Proof Technique.
Y. Lindell.
How To Simulate It - A Tutorial on the Simulation Proof Technique. Cryptology ePrint Archive: Report 2016/046, 2016.
Survey Papers by Co-Founders
Prof. Yehuda Lindell
Secure Multiparty Computation for Privacy-Preserving Data Mining.
Y. Lindell and B. Pinkas.
Secure Multiparty Computation for Privacy-Preserving Data Mining. In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009.
Survey Papers by Co-Founders
Prof. Yehuda Lindell
A Proof of Security of Yao's Protocol for Two-Party Computation.
Y. Lindell and B. Pinkas.
A Proof of Security of Yao's Protocol for Two-Party Computation. In the Journal of Cryptology, 22(2):161-188, 2009.
Survey Papers by Co-Founders
Prof. Yehuda Lindell
Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.
Y. Lindell and A. Nof. A
Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. In the 24th ACM CCS, pages 259-276, 2017.
Survey Papers by Co-Founders
Optimizing Yao and GMW for Semi Honest Adversaries (53 minutes)
5th BIU Winter School - Advances in Practical Secure Computation, 2015.
Survey Papers by Co-Founders
Book on secure computation
https://link.springer.com/book/10.1007%2F978-3-642-14303-8
Research on MPC by Co-Founders
Guy Peer
Fast Secure Two-Party ECDSA Signing
In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.
Research on MPC by Co-Founders
Nigel P. Smart
Modes of Operation Suitable for Computing on Encrypted Data.
Dragos Rotaru, Nigel P. Smart, Martijn Stam
Modes of Operation Suitable for Computing on Encrypted Data. IACR Trans. Symmetric Cryptol. 2017(3): 294-324 (2017) http://eprint.iacr.org/2017/496
Research on MPC by Co-Founders
Nigel P. Smart
When It's All Just Too Much: Outsourcing MPC-Preprocessing.
Peter Scholl, Nigel P. Smart, Tim Wood
When It's All Just Too Much: Outsourcing MPC-Preprocessing. IMACC 2017: 77-99 http://eprint.iacr.org/2017/262
Research on MPC by Co-Founders
Nigel P. Smart
MPC-Friendly Symmetric Key Primitives.
Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart
MPC-Friendly Symmetric Key Primitives. ACM Conference on Computer and Communications Security 2016: 430-443 http://eprint.iacr.org/2016/542
Research on MPC by Co-Founders
Nigel P. Smart
Dishonest Majority Multi-Party Computation for Binary Circuits.
Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
Dishonest Majority Multi-Party Computation for Binary Circuits. CRYPTO (2) 2014: 495-512 http://eprint.iacr.org/2014/101
Research on MPC by Co-Founders
Nigel P. Smart
An architecture for practical actively secure MPC with dishonest majority.
Marcel Keller, Peter Scholl, Nigel P. Smart
An architecture for practical actively secure MPC with dishonest majority. ACM Conference on Computer and Communications Security 2013: 549-560 http://eprint.iacr.org/2013/143
Research on MPC by Co-Founders
Nigel P. Smart
Practical Covertly Secure MPC for Dishonest Majority
Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, Nigel P. Smart
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. ESORICS 2013: 1-18 http://eprint.iacr.org/2012/642
Research on MPC by Co-Founders
Nigel P. Smart
Multiparty Computation from Somewhat Homomorphic Encryption.
Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias
Multiparty Computation from Somewhat Homomorphic Encryption. CRYPTO 2012: 643-662 http://eprint.iacr.org/2011/535
Research on MPC by Co-Founders
Nigel P. Smart
Secure Two-Party Computation Is Practical.
Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams:
Secure Two-Party Computation Is Practical. ASIACRYPT 2009: 250-267 http://eprint.iacr.org/2009/314
Research on MPC by Co-Founders
Nigel P. Smart
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol.
Ivan Damgård, Marcel Keller, Enrique Larraia, Christian Miles, Nigel P. Smart
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. SCN 2012: 241-263 http://eprint.iacr.org/2012/262
Research on Efficient MPC
Prof. Yehuda Lindell
Efficient Scalable Constant-Round MPC via Garbled Circuits.
A. Ben-Efraim, Y. Lindell and E. Omri.
Efficient Scalable Constant-Round MPC via Garbled Circuits. In ASIACRYPT 2017, Springer (LNCS 10625), pages 471-498, 2017.
Research on Efficient MPC
Prof. Yehuda Lindell
Fast Secure Two-Party ECDSA Signing.
Y. Lindell.
Fast Secure Two-Party ECDSA Signing. In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.
Research on Efficient MPC
Prof. Yehuda Lindell
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier.
T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein.
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. In the 38th IEEE Security and Privacy Conference, pages 843-862, 2017.
Research on Efficient MPC
Prof. Yehuda Lindell
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.
J. Furukawa, Y. Lindell, A. Nof and O. Weinstein.
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. In EUROCRYPT 2017, Springer (LNCS 10211), pages 225-255, 2017. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
More Efficient Constant-Round Multi-Party Computation from BMR and SHE.
Y. Lindell, N.P. Smart and E. Soria-Vazquez.
More Efficient Constant-Round Multi-Party Computation from BMR and SHE. In TCC 2016-B, Springer (LNCS 9985), pages 554-581, 2016.
Research on Efficient MPC
Prof. Yehuda Lindell
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
T. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara.
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. In the 23rd ACM CCS, pages 805-817, 2016. Recipient of the best-paper award.
Research on Efficient MPC
Prof. Yehuda Lindell
Optimizing Semi-Honest Secure Multiparty Computation for the Internet.
A. Ben-Efraim, Y. Lindell and E. Omri.
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. In the 23rd ACM CCS, pages 578-590, 2016.
Research on Efficient MPC
Prof. Yehuda Lindell
How To Simulate It - A Tutorial on the Simulation Proof Technique.
Y. Lindell.
How To Simulate It - A Tutorial on the Simulation Proof Technique. Cryptology ePrint Archive: Report 2016/046, 2016. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries.
Y. Lindell and B. Riva.
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries. In 22nd ACM CCS, pages 579-590, 2015. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
Fast Garbling of Circuits Under Standard Assumptions.
S. Gueron, Y. Lindell, A. Nof and B. Pinkas.
Fast Garbling of Circuits Under Standard Assumptions. In 22nd ACM CCS, pages 567-578, 2015. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.
G. Asharov, Y. Lindell, T. Schneier and M. Zohner.
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. In EUROCRYPT 2015, Springer (LNCS 9056), pages 673-701, 2015. To appear in the Journal of Cryptology.
Research on Efficient MPC
Prof. Yehuda Lindell
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings.
Y. Lindell and B. Riva.
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings. In CRYPTO 2014, Springer (LNCS 8617), pages 476-494, 2014. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation.
G. Asharov, Y. Lindell, T. Schneier and M. Zohner.
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. In the 20th ACM Conference on Computer and Communications Security (ACM CCS), pages 535-548, 2013. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.
Y. Lindell.
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries. In CRYPTO 2013, Springer (LNCS 8043), pages 1-17, 2013. In the Journal of Cryptology, 29(2):456-490, 2016. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
Y. Lindell, E. Oxman and B. Pinkas.
The IPS Compiler: Optimizations, Variants and Concrete Efficiency. In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
Secure Computation on the Web: Computing without Simultaneous Interaction.
S. Halevi, Y. Lindell, and B. Pinkas.
Secure Computation on the Web: Computing without Simultaneous Interaction. In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011. PDF
Research on Efficient MPC
Prof. Yehuda Lindell
Highly-Efficient Universally Composable Commitments based on the DDH Assumption.
Y. Lindell.
Highly-Efficient Universally Composable Commitments based on the DDH Assumption. In EUROCRYPT 2011, Springer (LNCS 6632), pages 446-466, 2011.
Research on Efficient MPC
Prof. Yehuda Lindell
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
Y. Lindell and B. Pinkas.
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. In the 8th TCC, Springer (LNCS 6597), pages 329-346, 2011. In the Journal of Cryptology, 25(4):680-722,2012.
Research on Efficient MPC
Prof. Yehuda Lindell
On the Black-Box Complexity of Optimally-Fair Coin Tossing.
D. Dachman-Soled, Y. Lindell, M. Mahmoody and T. Malkin.
On the Black-Box Complexity of Optimally-Fair Coin Tossing. In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011. Abstract, PDF.
Research on Efficient MPC
Prof. Yehuda Lindell
Constructions of Truly Practical Secure Protocols using Standard Smartcards.
C. Hazay and Y. Lindell.
Constructions of Truly Practical Secure Protocols using Standard Smartcards. In the 15th ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008.
Research on Efficient MPC
Prof. Yehuda Lindell
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.
Y. Lindell, B. Pinkas and N. Smart.
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008. Abstract, PDF.
Research on Efficient MPC
Prof. Yehuda Lindell
Efficient Fully-Simulatable Oblivious Transfer.
Y. Lindell.
Efficient Fully-Simulatable Oblivious Transfer. In the Chicago Journal of Theoretical Computer Science, 2008. Preliminary version appeared in CT-RSA, Springer (LNCS 4964), pages 52-70, 2008. Abstract, PDF.
Research on Efficient MPC
Prof. Yehuda Lindell
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
C. Hazay and Y. Lindell.
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In the Journal of Cryptology, 23(3):422-456, 2010. An extended abstract appeared in TCC 2008, Springer (LNCS 4948) pages 155-175, 2008.
Research on Efficient MPC
Prof. Yehuda Lindell
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
Y. Lindell and B. Pinkas.
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In Eurocrypt 2007, Springer-Verlag (LNCS 4515), pages 52-78, 2007. In the Journal of Cryptology, 28(2):312-350, 2015. Abstract, PDF.
Research on Efficient MPC
Prof. Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.
Y. Aumann and Y. Lindell.
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In the Journal of Cryptology, 23(2):281-343, 2010. An extended abstract appeared in TCC 2007, Springer-Verlag (LNCS 4392), pages 137-156, 2007.
Research on Efficient MPC
Prof. Yehuda Lindell
On the Feasibility of Extending Oblivious Transfer.
Y. Lindell and H. Zarosim.
On the Feasibility of Extending Oblivious Transfer. In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013.
Research on Theoretical Foundations of MPC
Nigel P. Smart
Between a Rock and a Hard Place: Interpolating between MPC and FHE.
Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating between MPC and FHE. ASIACRYPT (2) 2013: 221-240 http://eprint.iacr.org/2013/085
Research on Theoretical Foundations of MPC
Nigel P. Smart
Reducing the Overhead of MPC over a Large Population.
Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of MPC over a Large Population. SCN 2014: 197-217 http://eprint.iacr.org/2014/105
Research on Theoretical Foundations of MPC
Nigel P. Smart
Actively Secure Private Function Evaluation.
Payman Mohassel, Seyed Saeed Sadeghian, Nigel P. Smart:
Actively Secure Private Function Evaluation. ASIACRYPT (2) 2014: 486-505 http://eprint.iacr.org/2014/102
Research on Theoretical Foundations of MPC
Nigel P. Smart
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing
Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN 2016: 147-168 http://eprint.iacr.org/2015/705
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Secure Two-Party Computation with Fairness - A Necessary Design Principle.
Y. Lindell and T. Rabin.
Secure Two-Party Computation with Fairness - A Necessary Design Principle. In TCC 2017, Springer (LNCS 10677), pages 565-580, 2017.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
R. Canetti, A. Cohen and Y. Lindell.
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation. In CRYPTO 2015, Springer (LNCS 9216), pages 3-22, 2015. PDF
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle
Y. Lindell. An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle. In TCC 2015, Springer (LNCS 9014), pages 93-109, 2015.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.
R. Cohen and Y. Lindell.
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation. In ASIACRYPT 2014, Springer (LNCS 8873), pages 466-485, 2014. To appear in the Journal of Cryptology.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Hiding the Input-Size in Secure Two-Party Computation.
Y. Lindell, K. Nissim and C. Orlandi.
Hiding the Input-Size in Secure Two-Party Computation. In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 2013.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Fair and Efficient Secure Multiparty Computation with Reputation Systems.
G. Asharov, Y. Lindell and H. Zarosim
Fair and Efficient Secure Multiparty Computation with Reputation Systems. In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
G. Asharov, Y. Lindell and T. Rabin.
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Completeness for Symmetric Two-Party Functionalities - Revisited.
Y. Lindell, E. Omri and H. Zarosim. Completeness for Symmetric Two-Party Functionalities - Revisited. In ASIACRYPT 2012, Springer (LNCS 7658), pages 116-133, 2012. To appear in the Journal of Cryptology.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs.
D. Kidron and Y. Lindell.
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. In the Journal of Cryptology, 24(3):517-544, 2011. Abstract, PDF.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Perfectly-Secure Multiplication for any t
G. Asharov, Y. Lindell and T. Rabin.
Perfectly-Secure Multiplication for any t
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.
A. Beimel, Y. Lindell, E. Omri and I. Orlov.
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.
G. Asharov and Y. Lindell.
A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. In the Journal of Cryptology, 30(1):58-151, 2017.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.
Y. Lindell and H. Zarosim.
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. In the Journal of Cryptology, 24(4):761-799, 2011. An extended abstract appeared in the 6th TCC, Springer (LNCS 5444), pages 183-201, 2009.
Research on Theoretical Foundations of MPC
Complete Fairness in Secure Two-Party Computation. In the 40th STOC, pages 413-422, 2008.
S.D. Gordon, C. Hazay, J. Katz and Y. Lindell.
Complete Fairness in Secure Two-Party Computation. In the 40th STOC, pages 413-422, 2008. In the Journal of the ACM, 58(6):24, 2011.
Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank.
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. In CRYPTO 2006, Springer-Verlag (LNCS 4117), pages 483-500, 2006.
Nigel’s Videos
Nigel P. Smart
The Discrete log
The Discrete log on elliptic curves.
Nigel’s Videos
Nigel P. Smart
FHE with relatively small key sizes.
FHE with relatively small key sizes.
Nigel’s Videos
Nigel P. Smart
Cryptography
Cryptography: https://www.youtube.com/watch?v=bgPQP91hgqY
Nigel’s Videos
Nigel P. Smart
Living Between the Ideal and Real Worlds
Living Between the Ideal and Real Worlds. https://www.youtube.com/watch?v=B2nT6bFkzK0
Nigel’s Videos
Nigel P. Smart
Multi-Party Computation: From Theory to Practice
Multi-Party Computation: From Theory to Practice. https://www.youtube.com/watch?v=LRAN_w1_qmw
Nigel’s Videos
Nigel P. Smart
The basics of elliptic curves.
The basics of elliptic curves. https://www.youtube.com/watch?v=t3JzdKE-Fhs
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation and Efficiency
Sigma Protocols and Zero Knowledge (85 minutes), 1st BIU Winter School - Secure Computation and Efficiency, 2011.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Two-Party Computation for Malicious Adversaries
(90 minutes), 1st BIU Winter School - Secure Computation and Efficiency, 2011.
Yehuda’s Videos
Prof. Yehuda Lindell
The Yao Construction and its Proof of Security
1st BIU Winter School - Secure Computation and Efficiency, 2011.
Yehuda’s Videos
Prof. Yehuda Lindell
Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation
ACM CCS 2017 (winner of best paper award).
Yehuda’s Videos
Prof. Yehuda Lindell
Fast Secure Two Party ECDSA Signing (22 minutes),
CRYPTO conference, 2017.
Yehuda’s Videos
Prof. Yehuda Lindell
High-Throughput Secure Three-Party Computation with an Honest Majority - Breaking the Billion-Gate Per-Second Barrier
Real-World Crypto (RWC) conference, 2017.
Yehuda’s Videos
Prof. Yehuda Lindell
Fast Garbling of Circuits Under Standard Assumptions (35 minutes)
Simons Institute Workshop on Securing Computation, 2015.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Definitions and Oblivious Transfer (90 minutes)
5th BIU Winter School - Advances in Practical Secure Computation, 2015.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Efficient Zero-Knowledge (53 minutes)
5th BIU Winter School - Advances in Practical Secure Computation, 2015.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Security Against Malicious Adversaries (40 minutes)
5th BIU Winter School - Advances in Practical Secure Computation, 2015.
Yehuda’s Videos
Prof. Yehuda Lindell
Invited Talk: Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries (60 minutes)
Microsoft Workshop on Applied Multiparty Computation, 2014.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 1 of 3 (60 minutes)
Technion Summer School on Security, 2013.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 2 of 3 (50 minutes)
Technion Summer School on Security, 2013.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 3 of 3 (40 minutes)
Technion Summer School on Security, 2013.
Yehuda’s Videos
Prof. Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries (11 minutes)
Crypto 2013.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation on the Web: Computing without Simultaneous Interaction (20 minutes)
Crypto 2011.
Yehuda’s Videos
Prof. Yehuda Lindell
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency (20 minutes)
Crypto 2011.
Yehuda’s Videos
Prof. Yehuda Lindell
Secure Computation: Background and Definitions (90 minutes)
1st BIU Winter School - Secure Computation and Efficiency, 2011.
Research for Unbound
Guy Peer
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. (With M. Albrecht, E. Orsini, K.G. Paterson and G. Peer).
Proc ESORICS 2017, Springer LNCS 10492, 29-46, 2017. http://eprint.iacr.org/2017/354
Research for Unbound
Guy Peer, Prof. Yehuda Lindell , Nigel P. Smart
LIMA submission
LIMA submission to PQC competition: https://lima-pq.github.io