Yehuda Lindell

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.

[BibT_eX]

[DOI]

Ariel Nof

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation.

[BibT_eX]

[DOI]

Shay Gueron

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Efficient Scalable Constant-Round MPC via Garbled Circuits.

[BibT_eX]

[DOI]

Aner Ben-Efraim

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

How to Simulate It - A Tutorial on the Simulation Proof Technique.

[BibT_eX]

[DOI]

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

More Efficient Oblivious Transfer Extensions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

More Efficient Constant-Round Multi-party Computation from BMR and SHE.

[BibT_eX]

[DOI]

Nigel P. Smart

Eduardo Soria-Vazquez

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Attribute-based Key Exchange with General Policies.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Optimizing Semi-Honest Secure Multiparty Computation for the Internet.

[BibT_eX]

[DOI]

Aner Ben-Efraim

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Adaptively Secure Computation with Partial Erasures.

[BibT_eX]

[DOI]

Arpita Patra

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.

[BibT_eX]

[DOI]

Ran Canetti

Asaf Cohen

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries.

[BibT_eX]

[DOI]

Ben Riva

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Fast Garbling of Circuits Under Standard Assumptions.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte.

[BibT_eX]

[DOI]

Shay Gueron

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings.

[BibT_eX]

[DOI]

Ben Riva

IACR Cryptol. ePrint Arch., 2014

Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings.

[BibT_eX]

[DOI]

Ben Riva

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation.

[BibT_eX]

[DOI]

Ran Cohen

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

Introduction to Modern Cryptography, Second Edition

[BibT_eX]

[DOI]

CRC Press, ISBN: 9781466570269, 2014

2013

The BGW Protocol for Perfectly-Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

A Note on Constant-Round Zero-Knowledge Proofs of Knowledge.

[BibT_eX]

[DOI]

J. Cryptol., 2013

On the Feasibility of Extending Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Techniques for Efficient Secure Computation Based on Yao's Protocol.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

More efficient oblivious transfer and extensions for faster secure computation.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Hiding the Input-Size in Secure Two-Party Computation.

[BibT_eX]

[DOI]

Kobbi Nissim

Claudio Orlandi

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Fair and Efficient Secure Multiparty Computation with Reputation Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

SCAPI: The Secure Computation Application Programming Interface.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Completeness for Symmetric Two-Party Functionalities - Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Black-Box Constructions of Protocols for Secure Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Anonymous Authentication.

[BibT_eX]

[DOI]

J. Priv. Confidentiality, 2011

A Practical Application of Differential Privacy to Personalized Online Advertising.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Constant-Round Zero-Knowledge Proofs of Knowledge.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

On the Black-Box Complexity of Optimally-Fair Coin Tossing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

The IPS Compiler: Optimizations, Variants and Concrete Efficiency.

[BibT_eX]

[DOI]

Eli Oxman

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Secure Computation on the Web: Computing without Simultaneous Interaction.

[BibT_eX]

[DOI]

Shai Halevi

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Perfectly-Secure Multiplication for Any t < n/3.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

Efficient Secure Two-Party Protocols - Techniques and Constructions

[BibT_eX]

[DOI]

Information Security and Cryptography, Springer, ISBN: 978-3-642-14302-1, 2010

A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Private Web Search with Malicious Adversaries.

[BibT_eX]

[DOI]

Erez Waisbard

Proceedings of the Privacy Enhancing Technologies, 10th International Symposium, 2010

2009

Secure Computation for Privacy Preserving Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Secure Multiparty Computation for Privacy-Preserving Data Mining.

[BibT_eX]

[DOI]

J. Priv. Confidentiality, 2009

A Proof of Security of Yao's Protocol for Two-Party Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2009

Efficient Oblivious Polynomial Evaluation with Simulation-Based Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Legally Enforceable Fairness in Secure Two-Party Communication.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2009

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Local Sequentiality Does Not Help for Concurrent Composition.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2009

Adaptively Secure Two-Party Computation with Erasures.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2009

Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2009

Utility Dependence in Correct and Fair Rational Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Complete fairness in secure two-party computation.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.

[BibT_eX]

[DOI]

Nigel P. Smart

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Legally-Enforceable Fairness in Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2008

Efficient Fully-Simulatable Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2008

Aggregate Message Authentication Codes.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2008

Constructions of truly practical secure protocols using standard smartcards.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs.

[BibT_eX]

[DOI]

Dafna Kidron

IACR Cryptol. ePrint Arch., 2007

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.

[BibT_eX]

[DOI]

Yonatan Aumann

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Introduction to Modern Cryptography

[BibT_eX]

[DOI]

Chapman and Hall/CRC Press, ISBN: 978-1-58488-551-1, 2007

2006

A framework for password-based authenticated key exchange1.

[BibT_eX]

[DOI]

Rosario Gennaro

ACM Trans. Inf. Syst. Secur., 2006

A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Protocols for Bounded-Concurrent Secure Two-Party Computation.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2006

Information-theoretically secure protocols and security under composition.

[BibT_eX]

[DOI]

Eyal Kushilevitz

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Black-box constructions for secure computation.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

Secure Multi-Party Computation without Agreement.

[BibT_eX]

[DOI]

Shafi Goldwasser

J. Cryptol., 2005

Concurrent Composition of Secure Protocols in the Timing Model.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Manoj Prabhakaran

IACR Cryptol. ePrint Arch., 2005

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Concurrent general composition of secure protocols in the timing model.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Manoj Prabhakaran

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Universally Composable Password-Based Key Exchange.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Secure Computation Without Authentication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Lower Bounds and Impossibility Results for Concurrent Self Composition.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Protocol Initialization for the Framework of Universal Composability.

[BibT_eX]

[DOI]

Boaz Barak

IACR Cryptol. ePrint Arch., 2004

A Proof of Yao's Protocol for Secure Two-Party Computation

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Lower Bounds for Concurrent Self Composition.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003

General Composition and Universal Composability in Secure Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

Bounded-concurrent secure two-party computation without setup assumptions.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Brief announcement: impossibility results for concurrent secure two-party computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

General Composition and Universal Composability in Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

Lower Bounds for Non-Black-Box Zero Knowledge.

[BibT_eX]

[DOI]

Boaz Barak

Salil P. Vadhan

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

A Framework for Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

Rosario Gennaro

Proceedings of the Advances in Cryptology, 2003

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.

[BibT_eX]

[DOI]

Ran Canetti

Eyal Kushilevitz

Proceedings of the Advances in Cryptology, 2003

Composition of Secure Multi-Party Protocols, A Comprehensive Study

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 2815, Springer, ISBN: 3-540-20105-X, 2003

2002

Secure Computation without Agreement.

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Distributed Computing, 16th International Conference, 2002

On the composition of authenticated byzantine agreement.

[BibT_eX]

[DOI]

Anna Lysyanskaya

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Universally composable two-party and multi-party secure computation.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Strict polynomial-time in simulation and extraction.

[BibT_eX]

[DOI]

Boaz Barak

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Sequential composition of protocols without simultaneous termination.

[BibT_eX]

[DOI]

Anna Lysyanskaya

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Resettably-Sound Zero-Knowledge and its Applications.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

Session-Key Generation Using Human Passwords Only.

[BibT_eX]

[DOI]

Oded Goldreich

Proceedings of the Advances in Cryptology, 2001

2000

Privacy Preserving Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

1999

A Statistical Theory for Quantitative Association Rules.

[BibT_eX]

[DOI]

Yonatan Aumann