Carmit Hazay

Mor Weiss

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

A New Framework for Garbled Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.

[BibT_eX]

[DOI]

Ruihan Wang

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

ZK-PCPs from Leakage-Resilient Secret Sharing.

[BibT_eX]

[DOI]

Mor Weiss

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

Gradual GRAM and Secure Computation for RAM Programs.

[BibT_eX]

[DOI]

Mor Lilintal

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Multi-clients Verifiable Computation via Conditional Disclosure of Secrets.

[BibT_eX]

[DOI]

Rishabh Bhadauria

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Going Beyond Dual Execution: MPC for Functions with Efficient Verification.

[BibT_eX]

[DOI]

Abhi Shelat

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

The Price of Active Security in Cryptographic Protocols.

[BibT_eX]

[DOI]

Mor Weiss

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

[BibT_eX]

[DOI]

Rafael Pass

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Ligero++: A New Optimized Sublinear IOP.

[BibT_eX]

[DOI]

Rishabh Bhadauria

Zhiyong Fang

Mohammad Hossein Faghihi Sereshgi

Tiancheng Xie

Yupeng Zhang

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.

[BibT_eX]

[DOI]

Jackson Abascal

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.

[BibT_eX]

[DOI]

Gert Læssøe Mikkelsen

Tal Rabin

Tomas Toft

Angelo Agatino Nicolosi

J. Cryptol., 2019

LevioSA: Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

Antonio Marcedone

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

Fast Actively Secure Five-Party Computation with Security Beyond Abort.

[BibT_eX]

[DOI]

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

2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

CoRR, 2018

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

TinyKeys: A New Approach to Efficient Multi-Party Computation.

[BibT_eX]

[DOI]

Emmanuela Orsini

Peter Scholl

Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Round-Optimal Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Shai Halevi

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).

[BibT_eX]

[DOI]

Emmanuela Orsini

Peter Scholl

Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

Efficient One-Sided Adaptively Secure Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2017

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Scalable Multi-party Private Set-Intersection.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.

[BibT_eX]

[DOI]

Scott Ames

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

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.

[BibT_eX]

[DOI]

Peter Scholl

Eduardo Soria-Vazquez

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Efficient Set Intersection with Simulation-Based Security.

[BibT_eX]

[DOI]

J. Cryptol., 2016

Toward a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Gilad Asharov

Ran Canetti

J. Cryptol., 2016

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model.

[BibT_eX]

[DOI]

Avishay Yanai

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

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions.

[BibT_eX]

[DOI]

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

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.

[BibT_eX]

[DOI]

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

The Feasibility of Outsourced Database Search in the Plain Model.

[BibT_eX]

[DOI]

Hila Zarosim

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

What Security Can We Achieve Within 4 Rounds?

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

On the Power of Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

What Security can we Achieve in 4-Rounds?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Round-Optimal Token-Based Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs.

[BibT_eX]

[DOI]

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

Adaptively Secure Computation with Partial Erasures.

[BibT_eX]

[DOI]

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

On Black-Box Complexity of Universally Composable Security in the CRS Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

Selective Opening Security for Receivers.

[BibT_eX]

[DOI]

Bogdan Warinschi

2014

Two-Dimensional Parameterized Matching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

One-Sided Adaptively Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013

Outsourced Pattern Matching.

[BibT_eX]

[DOI]

Sebastian Faust

Daniele Venturi

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Leakage-Resilient Cryptography from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

2012

Secure Two-Party Computation with Low Communication.

[BibT_eX]

[DOI]

Ivan Damgård

Sebastian Faust

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Distributed public key schemes secure against continual leakage.

[BibT_eX]

[DOI]

Adi Akavia

Shafi Goldwasser

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

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.

[BibT_eX]

[DOI]

Gert Læssøe Mikkelsen

Tal Rabin

Tomas Toft

Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

Signature Schemes Secure against Hard-to-Invert Leakage.

[BibT_eX]

[DOI]

Sebastian Faust

Jesper Buus Nielsen

Peter Sebastian Nordholt

Angela Zottarel

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Towards a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Gilad Asharov

Ran Canetti

Proceedings of the Advances in Cryptology - EUROCRYPT 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

Automata Evaluation and Text Search Protocols with Simulation Based Security.

[BibT_eX]

[DOI]

Rosario Gennaro

Jeffrey S. Sorensen

IACR Cryptol. ePrint Arch., 2010

Efficient Set Operations in the Presence of Malicious Adversaries.

[BibT_eX]

[DOI]

Kobbi Nissim

Proceedings of the Public Key Cryptography, 2010

Text Search Protocols with Simulation Based Security.

[BibT_eX]

[DOI]

Rosario Gennaro

Jeffrey S. Sorensen

Proceedings of the Public Key Cryptography, 2010

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries.

[BibT_eX]

[DOI]

Tomas Toft

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Efficient Oblivious Polynomial Evaluation with Simulation-Based Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

On Compression of Data Encrypted with Block Ciphers.

[BibT_eX]

[DOI]

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

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

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

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

2005

Two Dimensional Parameterized Matching.

[BibT_eX]

[DOI]

Moshe Lewenstein

Dekel Tsur

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Approximate Parameterized Matching.

[BibT_eX]

[DOI]