tech-MPC-labs

MPC Labs

Secure Multiparty Computation (MPC) has multiple applications in the fields of key protection and data privacy. Unbound is at the forefront of MPC research, developing solutions that enable scalable, private and secure data processing and sharing. Unbound’s investment in research ensures that Unbound’s solutions utilize cutting edge technology, built on strong scientific foundations.

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’s Co-founders Prof. Yehuda Lindell and Prof. Nigel Smart are regarded to be amongst the world’s leaders in Multi-Party Computation research. They co-founded Unbound together with Guy Peer 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 in modern computing environments.

About the Researchers

Prof. Yehuda Lindell
  • Prof. Yehuda Lindell
    Co-founder and CEO, Cryptographer
Prof. Yehuda Lindell
Prof. Yehuda Lindell
Co-founder and CEO, Cryptographer
Yehuda Lindell is the CEO and co-founder of Unbound Tech. Yehuda is also a professor of Computer Science at Bar-Ilan University in Israel, and a cryptographer with expertise in secure multiparty computation (MPC) that forms the technological core of Unbound’s solutions. Yehuda attained his Ph.D. at the Weizmann Institute of Science in 2002 and spent two years at the IBM T.J. Watson research lab as a Postdoctoral fellow in the cryptography research group. Yehuda has carried out extensive research in cryptography, and has published over 100 conference and journal publications, most of them on MPC, and has authored three books, one of them a widely used textbook on modern cryptography. In addition to Yehuda’s notable academic work, he has significant industry experience in the design and deployment of cryptography in a wide variety of scenarios. Yehuda served as the Chief Scientist of Unbound from its inception until February 2019, when he took over the role as CEO.
Nigel Smart
  • Prof. Nigel Smart
    Co-Founder, Cryptographer
Nigel Smart
Prof. Nigel Smart
Co-Founder, Cryptographer
Nigel Smart received his BSc degree from the University of Reading in 1989 and his PhD degree from the University of Kent at Canterbury in 1992. Nigel spent three years at Hewlett-Packard from 1997 to 2000. From 2000 to 2017 he was at the University of Bristol. In 2018 he joined the COSIC group at the Katholieke Universiteit Leuven. Nigel has held a Royal Society Wolfson Merit Award, and two ERC Advanced Grants. He was Vice President of the International Association for Cryptologic Research (2014-2016). In 2016 he was named as a Fellow of the IACR. Nigel was a founder of the startup Identum, which was bought by Trend Micro in 2008. He is also the co-founder of the Real World Cryptography conference series.
samuel-ranelluci
  • Dr. Samuel Ranellucci
    Cryptographer
samuel-ranelluci
Dr. Samuel Ranellucci
Cryptographer
Samuel Ranellucci is a full-time cryptographer at Unbound Tech. Samuel is an expert on MPC with over a decade of research in the field. Samuel’s research on practical MPC has appeared in top security venues, and he received the best paper award at the ACM CCS conference for “Authenticated Garbling and Communication-efficient, Constant-round, Secure Two-party Computation”. At Unbound Tech, he continues to develop state-of-the art cryptographic protocols for MPC. He received his PhD in Computer Science from the University of Montreal, and carried out postdoctoral research at Aarhus with Ivan Damgård, and at the University of Maryland with Jonathan Katz and Dov Gordon.
man-in-t-shirtArtboard-2
  • Prof. Iftach Haitner
    Cryptographer
man-in-t-shirtArtboard-2
Prof. Iftach Haitner
Cryptographer
Iftach Haitner is a professor at the School of Computer Science at Tel Aviv University.
He is also the director of the Check Point Institute for Information Security and a member of the Theory of Computation Group. Until July 2010, he was a postdoctoral researcher at Microsoft Research New England. He received his PhD in 2008 from the Weizmann Institute of Science. He received his Master’s degree from the Weizmann Institute as well, and received his Bachelor’s degree (Mathematics and Computer Science) from the Tel-Aviv University. Iftach is part of the MPC research team at Unbound, working on both the efficiency of Unbound’s protocols and validating their security.

All Documents

Survey Papers
Prof. Yehuda Lindell
Secure Multiparty Computation (MPC).

Y. Lindell.

Communications of the ACM (CACM), 64(1):86–96, 2021.

Technical course in MPC
Prof. Nigel Smart
COED Introduction Part A
A high level introduction to computing on encrypte data. What is the difference between FHE and MPC? What do you first need to consider when thinking about a use-case?
Technical course in MPC
Prof. Nigel Smart
COED Introduction Part B
In this lecture we discuss a number of use cases we have looked at at KU Leuven for both MPC and FHE.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture A Part 1

The first part of a mini-series on Multi-Party Computation. This part introduces the basic definitions.

COSIC – Computer Security and Industrial Cryptography.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture A Part 2
The second part discusses a basic MPC protocol based on Fully Homomorphic Encryption.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture A Part 3
In the third part we describe Shamir secret sharing and its link with Reed-Solomon codes.
COSIC – Computer Security and Industrial Cryptography.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture A Part 4
In the fourth part we introduce linear secret sharing schemes, and we show how one can check that the values sent to you are consistent, .i.e. the adversary is not lying.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture B Part 1
Having detailed how to do linear operations, we need now to move to non-linear operations. In this part we discuss what it means for a Q2 LSSS to be multiplicative.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture B Part 2
Now we know what it means for a LSSS to be multiplicative, we can easily come up with protocols for the pre-processing needed for our MPC protocol.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture B Part 3

This part examines how to perform pre-processing in the case of Full Threshold access structures.

COSIC – Computer Security and Industrial Cryptography.
Technical course in MPC
Prof. Nigel Smart
MPC Course Lecture B Part 4
In this part we cover sacrificing; a way of turning passive pre-processing protocols into actively secure ones. Plus we finally cover the online phase, which enables us to actually perform MPC.
COSIC – Computer Security and Industrial Cryptography.
Technical course in MPC
Prof. Nigel Smart
MPC Course: Yao Circuits Part 1
In this lecture we discuss the construction of Yao’s garbled circuits and a basic Oblivious Transfer protocol.
COSIC – Computer Security and Industrial Cryptography.
Technical course in MPC
Prof. Nigel Smart
MPC Course: Yao Circuits Part 2

In this second part on Yao Circuit based protocols we show how garbled circuits plus OT allow us to give a simple two party MPC protocol. We then go on to show how to optimize the basic garbling technique using “signal bits” and “Free-XOR” gates.

COSIC – Computer Security and Industrial Cryptography.

 

Technical course in MPC
Prof. Nigel Smart
MPC Course: Yao Circuits Part 3
We now turn to actively secure variants of Yao’s protocol.
COSIC – Computer Security and Industrial Cryptography
Videos
Prof. Nigel Smart
Homomorphic Encryption.

CIF Seminar, 2020.

Research on Efficient MPC
Prof. Nigel Smart
Overdrive2k: Efficient Secure MPC over Z_{2^k} from Somewhat Homomorphic Encryption.

E. Orsini, N.P. Smart and F. Vercauteren.

In CT-RSA 2020, pages 254-283, 2020.

Research on Efficient MPC
Prof. Nigel Smart
Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol.

D. Cozzo and N.P. Smart.

In PQCrypto 2020, pages 169-186, 2020.

 

Research on Efficient MPC
Prof. Nigel Smart
Thresholdizing HashEdDSA: MPC to the Rescue.

C. Bonte, N.P. Smart and T. Tanguy.

Cryptology ePrint Archive, 2020.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
Secure Parallel Computation on National Scale Volumes of Data.

S. Mazloom, P.H. Le, S. Ranellucci and S.D. Gordon.

In USENIX Security Symposium 2020, pages 2487-2504, 2020.

Videos
Prof. Yehuda Lindell
Introduction to Multiparty Computation by Yehuda Lindell

fhe.org Community meetup, 2021.

Videos
Prof. Nigel Smart
COSIC Course 2019 – Computing on Encrypted Data.

COSIC – Computer Security and Industrial Cryptography, 2019.

Research on Efficient MPC
Prof. Yehuda Lindell
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest.

J. Furukawa and Y. Lindell.

In the 26th ACM CCS, pages 1557-1571, 2019.

Research on Efficient MPC
Dr. Samuel Ranellucci
Two-party Private Set Intersection with an Untrusted Third Party.

P.H. Le, S. Ranellucci and S.D. Gordon.

In ACM CCS 2019, pages 2403-2430, 2019.

Research on Efficient MPC at Unbound
Prof. Yehuda Lindell, Prof. Nigel Smart
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme

M. Kraitsberg, Y. Lindell, V. Osheter, N.P. Smart and Y.T. Alaoui.

In ACISP 2019, pages 192-210, 2019.

Videos
Prof. Yehuda Lindell
Cryptocurrency Protection with MPC & Threshold ECDSA.

Unbound Crypto Breakfast Series, 2019.

Videos
Prof. Yehuda Lindell
New Directions in Software Key Protection.

Unbound Crypto Breakfast Series, 2019.

Videos
Prof. Yehuda Lindell
A Full CryptoCurrency Custody Solution Based on MPC and Threshold ECDSA.

Real-World Crypto (RWC) conference, 2019.

Research on Efficient MPC
Prof. Yehuda Lindell
Fast Garbling of Circuits over 3-Valued Logic.

Y. Lindell and A. Yanai.

In the 21st PKC, Springer (LNCS 10769), pages 620-643, 2018.

 

Research on Efficient MPC
Prof. Yehuda Lindell
Privacy-Preserving Search of Similar Patients in Genomic Data.

G. Asharov, S. Halevi, Y. Lindell and T. Rabin.

In the 18th Privacy Enhancing Technologies Symposium, PoPETs 2018(4):104–124, 2018.

Research on Efficient MPC
Prof. Yehuda Lindell
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

K. China, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell and A. Nof.

In CRYPTO 2018, Springer (LNCS 10993), pages 34-64, 2018.

Research on Efficient MPC
Prof. Yehuda Lindell
Generalizing the SPDZ Compiler For Other Protocols.

T. Araki, A. Barak, J. Furukawa, M. Keller, Y. Lindell, K. Ohara and H. Tsuchida.

In the 25th ACM CCS, pages 880-895, 2018.

Research on Efficient MPC
Prof. Yehuda Lindell
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants.

A. Barak, M. Hirt, L. Koskas and Y. Lindell.

In the 25th ACM CCS, pages 695-712, 2018.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
Best of Both Worlds in Secure Computation, with Low Communication Overhead.

D. Genkin, S.D. Gordon and S. Ranellucci.

In ACNS 2018, pages 340-359, 2018.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
Secure Computation with Low Communication from Cross-Checking.

S.D. Gordon, S. Ranellucci and X. Wang.

In ASIACRYPT 2018, pages 59-85, 2018.

Research on Efficient MPC
Dr. Samuel Ranellucci
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.

J. Katz, S. Ranellucci, M. Rosulek and X. Wang.

In CRYPTO 2018, pages 365-391, 2018.

Research on Efficient MPC at Unbound
Prof. Yehuda Lindell, Dr. Samuel Ranellucci
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.

Y. Lindell, A. Nof and S. Ranellucci

In the 25th ACM CCS, pages 1837-1854, 2018.

Research on Efficient MPC at Unbound
Prof. Yehuda Lindell
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries.

T. Frederiksen, Y. Lindell, V. Osheter and B. Pinkas.

In CRYPTO 2018, Springer (LNCS 10992), pages 331-361, 2018.

Research on Efficient MPC at Unbound
Prof. Nigel Smart
LIMA submission.

M.R. Albrecht, Y. Lindell, E. Orsini, V. Osheter, K.G. Paterson, G. Peer and N.P. Smart.

LIMA submission to PQC competition: https://lima-pq.github.io

Survey Papers
Prof. Yehuda Lindell, Prof. Nigel Smart
From Keys to Databases – Real-World Applications of Secure Multi-Party Computation.

D.W. Archer, D. Bogdanov, L. Kamm, Y. Lindell, K. Nielsen, J.I. Pagter, N.P. Smart and R.N. Wright.

The Computer Journal 61(12):1749-1771, 2018.

Videos
Prof. Nigel Smart
Living Between the Ideal and Real Worlds.

Invited talk Eurocrypt 2017.

Research on Efficient MPC
Prof. Nigel Smart
Modes of Operation Suitable for Computing on Encrypted Data.

D. Rotaru, N.P. Smart and M. Stam.

In IACR Transactions on Symmetric Cryptology 2017(3):294-324, 2017.

 

Research on Efficient MPC
Prof. Nigel Smart
When It’s All Just Too Much: Outsourcing MPC-Preprocessing.

P. Scholl, N.P. Smart and T. Wood.

In IMACC 2017, pages 77-99, 2017.

 

Research on Efficient MPC
Prof. Yehuda Lindell
Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.

Y. Lindell and A. Nof. A

In the 24th ACM CCS, pages 259-276, 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.

In the 38th IEEE Security and Privacy Conference, pages 843-862, 2017.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.

X. Wang, S. Ranellucci and J. Katz.

In ACM CCS 2017, pages 21-37, 2017.

Research on Efficient MPC
Dr. Samuel Ranellucci
Global-Scale Secure Multiparty Computation.

X. Wang, S. Ranellucci and J. Katz.

In ACM CCS 2017, pages 39-56, 2017.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.

I. Damgård, J.B. Nielsen, M. Nielsen and S. Ranellucci.

In CRYPTO 2017, pages 167-187, 2017.

 

Research on Efficient MPC
Dr. Samuel Ranellucci
On the Computational Overhead of MPC with Dishonest Majority.

J.B. Nielsen and S. Ranellucci.

In PKC 2017, pages 369-395, 2017.

Research on Efficient MPC at Unbound
Prof. Nigel Smart
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts.

Martin R. Albrecht , Emmanuela Orsini , Kenneth G. Paterson , Guy Peer , and Nigel P. Smart

In ESORICS 2017, Springer (LNCS 10492), pages 29-46, 2017.

Research on Efficient MPC at Unbound
Prof. Yehuda Lindell
Fast Secure Two-Party ECDSA Signing.

Y. Lindell.

In CRYPTO 2017, Springer (LNCS 10402), pages 613-644, 2017.

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.

In the Journal of Cryptology, 30(1):58-151, 2017.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Secure Two-Party Computation with Fairness – A Necessary Design Principle.

Y. Lindell and T. Rabin.

In TCC 2017, Springer (LNCS 10677), pages 565-580, 2017.

Research on Theoretical Foundations of MPC
Dr. Samuel Ranellucci
Resource-Efficient OT Combiners with Active Security.

I. Cascudo, I. Damgård, O. Farràs and S. Ranellucci.

In TCC 2017, pages 461-486, 2017.

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.

Videos
Prof. Yehuda Lindell
Fast Secure Two-Party ECDSA Signing.

Crypto 2017.

Videos
Prof. Yehuda Lindell
High-Throughput Secure Three-Party Computation with an Honest Majority.

I-CORE day, Tel-Aviv, 2017.

Research on Efficient MPC
Prof. Nigel Smart
MPC-Friendly Symmetric Key Primitives.

L. Grassi, C. Rechberger, D. Rotaru, P. Scholl and N.P. Smart.

In ACM CCS 2016, pages 430-443, 2016.

Research on Efficient MPC
Prof. Nigel 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

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.

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.

In the 23rd ACM CCS, pages 578-590, 2016.

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.

In TCC 2016-B, Springer (LNCS 9985), pages 554-581, 2016.

Research on Theoretical Foundations of MPC
Dr. Samuel Ranellucci
Reactive Garbling: Foundation, Instantiation, Application.

J.B. Nielsen and S. Ranellucci.

In ASIACRYPT 2016, pages 1022-1052, 2016.

Survey Papers
Prof. Yehuda Lindell
How To Simulate It – A Tutorial on the Simulation Proof Technique.

Y. Lindell.

Tutorials on the Foundations of Cryptography, pages 277-346, 2017.

Research on Efficient MPC
Prof. Yehuda Lindell
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle

Y. Lindell.

In TCC 2015, Springer (LNCS 9014), pages 93-109, 2015.

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.

In 22nd ACM CCS, pages 579-590, 2015.

Research on Efficient MPC
Prof. Yehuda Lindell
Fast Garbling of Circuits Under Standard Assumptions.

S. Gueron, Y. Lindell, A. Nof and B. Pinkas.

In 22nd ACM CCS, pages 567-578, 2015.

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.

In the Journal of Cryptology, 30(3):805–858, 2017 (extended abstract at EUROCRYPT 2015).

Research on Efficient MPC
Prof. Yehuda Lindell, Prof. Nigel Smart
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.

Y. Lindell, B. Pinkas, N. Smart and A. Yanai.

In CRYPTO 2015, Springer (LNCS 9216), pages 319-338, 2015.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Adaptively Secure Computation with Partial Erasures.

C. Hazay, Y. Lindell and A. Patra.

In ACM PODC 2015, pages 291-300, 2015.

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.

In CRYPTO 2015, Springer (LNCS 9216), pages 3-22, 2015.

Videos
Prof. Yehuda Lindell
Optimizing Yao and GMW for Semi Honest Adversaries.

5th BIU Winter School – Advances in Practical Secure Computation, 2015.

Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Efficient Zero-Knowledge.

5th BIU Winter School – Advances in Practical Secure Computation, 2015.

Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Security Against Malicious Adversaries.

5th BIU Winter School – Advances in Practical Secure Computation, 2015.

Videos
Prof. Yehuda Lindell
Optimizing Yao and GMW for Semi Honest Adversaries.

5th BIU Winter School – Advances in Practical Secure Computation, 2015.

Videos
Prof. Yehuda Lindell
Fast Garbling of Circuits Under Standard Assumptions.

Simons Institute Workshop on Securing Computation, 2015.

Videos
Prof. Yehuda Lindell
Secure Computation Tutorial: Definitions and Oblivious Transfer.

5th BIU Winter School – Advances in Practical Secure Computation, 2015.

Research on Efficient MPC
Prof. Nigel Smart
Dishonest Majority Multi-Party Computation for Binary Circuits.

E. Larraia, E. Orsini and N.P. Smart.

In CRYPTO 2014, pages 495-512, 2014.

 

Research on Efficient MPC
Prof. Nigel Smart
Reducing the Overhead of MPC over a Large Population.

A. Choudhury, A. Patra and N.P. Smart.

In SCN 2014, pages 197-217, 2014.

Research on Efficient MPC
Prof. Nigel Smart
Actively Secure Private Function Evaluation.

P. Mohassel, S.S. Sadeghian and N.P. Smart.

In ASIACRYPT 2014, pages 486-505, 2014.

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.

In CRYPTO 2014, Springer (LNCS 8617), pages 476-494, 2014.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation.

R. Cohen and Y. Lindell.

In the Journal of Cryptology, 30(4):1157–1186, 2017 (extended abstract at ASIACRYPT 2014).

Videos
Prof. Yehuda Lindell
Invited Talk: Efficient Two-Party Secure Computation for Semi-Honest and Malicious Adversaries.

Microsoft Workshop on Applied Multiparty Computation, 2014.

Videos
Prof. Nigel Smart
Multi-Party Computation: From Theory to Practice.

Google Tech Talks, 2013.

Research on Efficient MPC
Prof. Nigel Smart
An Architecture for Practical Actively Secure MPC with Dishonest Majority.

M. Keller, P. Scholl and N.P. Smart.

In ACM CCS 2013, pages 549-560, 2013.

Research on Efficient MPC
Prof. Nigel Smart
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits.

I. Damgård, M. Keller, E. Larraia, V. Pastro, P. Scholl and N.P. Smart.

In ESORICS 2013, pages 1-18, 2013.

Research on Efficient MPC
Prof. Nigel Smart
Between a Rock and a Hard Place: Interpolating between MPC and FHE.

A. Choudhury, J. Loftus, E. Orsini, A. Patra and N.P. Smart.

In ASIACRYPT 2013, pages 221-240, 2013.

Research on Efficient MPC
Prof. Yehuda Lindell
Fair and Efficient Secure Multiparty Computation with Reputation Systems.

G. Asharov, Y. Lindell and H. Zarosim.

In ASIACRYPT 2013, Springer (LNCS 8270), pages 201-220, 2013

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.

In the 20th ACM Conference on Computer and Communications Security (ACM CCS), pages 535-548, 2013.

Research on Efficient MPC
Prof. Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.

Y. Lindell.

In the Journal of Cryptology, 29(2):456-490, 2016 (extended abstract at CRYPTO 2013).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On the Feasibility of Extending Oblivious Transfer.

Y. Lindell and H. Zarosim.

In the 10th TCC, Springer (LNCS 7785), pages 519-538, 2013.

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.

In ASIACRYPT 2013, Springer (LNCS 8270), pages 421-440, 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.

In the 10th TCC, Springer (LNCS 7785), pages 243-262, 2013.

Videos
Prof. Yehuda Lindell
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.

Crypto 2013.

Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 1 of 3.

Technion Summer School on Security, 2013.

Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 2 of 3.

Technion Summer School on Security, 2013.

Videos
Prof. Yehuda Lindell
Secure Two-Party Computation in Practice: Part 3 of 3.

Technion Summer School on Security, 2013.

Research on Efficient MPC
Prof. Nigel Smart
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol.

I. Damgård, M. Keller, E. Larraia, C. Miles and N.P. Smart.

In SCN 2012, pages 241-263, 2012.

Research on Efficient MPC
Prof. Nigel Smart
Multiparty Computation from Somewhat Homomorphic Encryption.

I. Damgård, V.Pastro, N.P. Smart and S. Zakarias.

In CRYPTO 2012, pages 643-662, 2012

Research on Efficient MPC
Prof. Yehuda Lindell
SCAPI: The Secure Computation Application Programming Interface.

Y. Ejgenberg, M. Farbstein, M. Levy and Y. Lindell.

Technical Report, 2012.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Completeness for Symmetric Two-Party Functionalities – Revisited.

Y. Lindell, E. Omri and H. Zarosim.

In the Journal of Cryptology, 31(3):671–697, 2018 (extended abstract at ASIACRYPT 2012).

Research on Efficient MPC
Prof. Yehuda Lindell
Highly-Efficient Universally Composable Commitments based on the DDH Assumption.

Y. Lindell.

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.

In the Journal of Cryptology, 25(4):680-722,2012 (extended abstract appeared at TCC 2011).

Research on Efficient MPC
Prof. Yehuda Lindell
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.

Y. Lindell, E. Oxman and B. Pinkas.

In CRYPTO 2011, Springer (LNCS 6841), pages 259-276, 2011.

Research on Efficient MPC
Prof. Yehuda Lindell
Secure Computation on the Web: Computing without Simultaneous Interaction.

S. Halevi, Y. Lindell, and B. Pinkas.

In CRYPTO 2011, Springer (LNCS 6841), pages 132-150, 2011.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On the Black-Box Complexity of Optimally-Fair Coin Tossing.

D. Dachman-Soled, Y. Lindell, M. Mahmoody and T. Malkin.

In the 8th TCC, Springer (LNCS 6597), pages 450-467, 2011.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.

Y. Lindell and H. Zarosim.

In the Journal of Cryptology, 24(4):761-799, 2011 (extended abstract at TCC 2009).

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.

In the Journal of Cryptology, 24(3):517-544, 2011.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Perfectly-Secure Multiplication for any t<n/3.

G. Asharov, Y. Lindell and T. Rabin.

In CRYPTO 2011, Springer (LNCS 6841), pages 240-258, 2011.

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.

In CRYPTO 2011, Springer (LNCS 6841), pages 277-296, 2011.

Videos
Prof. Yehuda Lindell
Secure Computation on the Web: Computing without Simultaneous Interaction.

Crypto 2011.

Videos
Prof. Yehuda Lindell
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.

Crypto 2011.

Videos
Prof. Yehuda Lindell
Secure Computation: Background and Definitions.

1st BIU Winter School – Secure Computation and Efficiency, 2011.

Videos
Prof. Yehuda Lindell
Sigma Protocols and Zero Knowledge.

1st BIU Winter School – Secure Computation and Efficiency, 2011.

Videos
Prof. Yehuda Lindell
Secure Two-Party Computation for Malicious Adversaries.

1st BIU Winter School – Secure Computation and Efficiency, 2011.

Videos
Prof. Yehuda Lindell
The Yao Construction and its Proof of Security.

1st BIU Winter School – Secure Computation and Efficiency, 2011.

Videos
Prof. Nigel Smart
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.

PKC 2010.

Research on Efficient MPC
Prof. Yehuda Lindell
Efficient Secure Two-Party Protocols: Techniques and Constructions.

Carmit Hazay, Yehuda Lindell

Information Security and Cryptography Series, Springer-Verlag, 2010.

Research on Efficient MPC
Prof. Yehuda Lindell
Adaptively Secure Two-Party Computation with Erasures.

Y. Lindell.

In CT-RSA, Springer (LNCS 5473), pages 117-132, 2009.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
A Proof of Security of Yao’s Protocol for Two-Party Computation.

Y. Lindell and B. Pinkas.

In the Journal of Cryptology, 22(2):161-188, 2009.

Survey Papers
Prof. Yehuda Lindell
Secure Multiparty Computation for Privacy-Preserving Data Mining.

Y. Lindell and B. Pinkas.

In the Journal of Privacy and Confidentiality, 1(1):59-98, 2009.

Research on Efficient MPC
Prof. Yehuda Lindell
Constructions of Truly Practical Secure Protocols using Standard Smartcards.

C. Hazay and Y. Lindell.

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.

In the 6th Conference on Security and Cryptography for Networks, Springer (LNCS 5229), pages 2-20, 2008

Research on Efficient MPC
Prof. Yehuda Lindell
Efficient Fully-Simulatable Oblivious Transfer.

Y. Lindell.

In CT-RSA, Springer (LNCS 4964), pages 52-70, 2008.

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.

In the Journal of Cryptology, 23(3):422-456, 2010 (extended abstract appeared at TCC 2008).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Complete Fairness in Secure Two-Party Computation.

S.D. Gordon, C. Hazay, J. Katz and Y. Lindell.

In the Journal of the ACM, 58(6):24, 2011 (extended abstract at STOC 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.

In the Journal of Cryptology, 28(2):312-350, 2015 (extended abstract appeared at Eurocrypt 2007).

Research on Efficient MPC
Prof. Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.

Y. Aumann and Y. Lindell.

In the Journal of Cryptology, 23(2):281-343, 2010 (extended abstract appeared at TCC 2007).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On Achieving the “Best of Both Worlds” in Secure Multiparty Computation.

Y. Ishai, J. Katz, E. Kushilevitz, Y. Lindell and E. Petrank.

In the SIAM Journal on Computing, 40(1):122– 141, 2011 (extended abstracts at Crypto 2006 and STOC 2007).

 

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Information-Theoretically Secure Protocols and Security Under Composition.

E. Kushilevitz, Y. Lindell and T. Rabin.

In the SIAM Journal on Computing, 39(4):2090-2112, 2010 (extended abstract at STOC 2006).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Black-Box Constructions for Secure Computation.

I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell and E. Petrank.

In the SIAM Journal on Computing, 40(2):225-266, 2011 (extended abstract at STOC 2006).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Secure Computation Without Authentication.

B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin.

In the Journal of Cryptology, 24(4):720-760, 2011 (extended abstract at CRYPTO 2005).

 

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.

J. Katz and Y. Lindell.

In the Journal of Cryptology, 21(3):303-349, 2008 (extended abstract at TCC 2005).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Concurrent Composition of Secure Protocols in the Timing Model.

Y.T. Kalai, Y. Lindell and M. Prabhakaran.

In the Journal of Cryptology, 20(4):431-492, 2007 (extended abstract at STOC 2005).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Lower Bounds and Impossibility Results for Concurrent Self Composition.

Y. Lindell.

In the Journal of Cryptology, 21(2):200-249, 2008 (combined papers from STOC 2003 and TCC 2004).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Protocol Initialization for the Framework of Universal Composability.

B. Barak, Y. Lindell and T. Rabin.

Technical Report, 2004.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.

R. Canetti, E. Kushilevitz and Y. Lindell.

In the Journal of Cryptology, 19(2):135-167, 2006 (extended abstract at Eurocrypt 2003).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
General Composition and Universal Composability in Secure Multi-Party Computation.

Y. Lindell.

In the Journal of Cryptology, 22(3):395-428, 2009 (extended abstract at FOCS 2003).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Universally Composable Two-Party and Multi-Party Secure Computation.

R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai.

In 34th STOC, pages 494-503, 2002.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
On the Composition of Authenticated Byzantine Agreement.

Y. Lindell, A. Lysyanskaya and T. Rabin.

In the Journal of the ACM, 53(6):881-917, 2006 (extended abstract at STOC 2002).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Sequential Composition of Protocols without Simultaneous Termination.

Y. Lindell, A. Lysyanskaya and T. Rabin.

In 21st PODC, pages 203-212, 2002.

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Secure Computation Without Agreement.

S. Goldwasser and Y. Lindell.

In the Journal of Cryptology, 18(3):247-287, 2005 (extended abstract at DISC 2002).

Research on Theoretical Foundations of MPC
Prof. Yehuda Lindell
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.

Y. Lindell.

In the Journal of Cryptology, 16(3):143-184, 2003 (extended abstract at Crypto 2001).

Research on Efficient MPC
Prof. Yehuda Lindell
Privacy Preserving Data Mining.

Y. Lindell and B. Pinkas.

In the Journal of Cryptology, 15(3):177-206, 2002 (extended abstract at Crypto 2000).