Search Results - "Hazay, Carmit"

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs by Hazay, Carmit

“…In this paper, we study the two fundamental functionalities oblivious polynomial evaluation in the exponent and set-intersection and introduce a new technique…”
Get full text

Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan, Weiss, Mor

“…Leakage-resilient cryptography aims to protect cryptographic primitives from so-called “side channel attacks” that exploit their physical implementation to…”
Get full text

The Price of Active Security in Cryptographic Protocols by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan, Weiss, Mor

“…We construct the first actively-secure Multi-Party Computation (MPC) protocols with an arbitrary number of parties in the dishonest majority setting, for an…”
Get full text

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer by Hazay, Carmit, Scholl, Peter, Soria-Vazquez, Eduardo

“…In this work, we present two new actively secure, constant-round multi-party computation (MPC) protocols with security against all-but-one corruptions. Our…”
Get full text

ZK-PCPs from Leakage-Resilient Secret Sharing by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan, Weiss, Mor

“…Zero-Knowledge PCPs (ZK-PCPs; Kilian, Petrank, and Tardos, STOC ‘97) are PCPs with the additional zero-knowledge guarantee that the view of any (possibly…”
Get full text

Efficient Set Intersection with Simulation-Based Security by Freedman, Michael J., Hazay, Carmit, Nissim, Kobbi, Pinkas, Benny

“…We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large…”
Get full text

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model by Hazay, Carmit, Ishai, Yuval, Venkitasubramaniam, Muthuramakrishnan

“…We consider the problem of constant-round secure two-party computation in the presence of active (malicious) adversaries. We present the first protocol that…”
Get full text

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting by Hazay, Carmit, Mikkelsen, Gert Læssøe, Rabin, Tal, Toft, Tomas, Nicolosi, Angelo Agatino

“…The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many…”
Get full text

Ligero: lightweight sublinear arguments without a trusted setup by Ames, Scott, Hazay, Carmit, Ishai, Yuval, Venkitasubramaniam, Muthuramakrishnan

“…We design and implement a simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification…”
Get full text

TinyKeys: A New Approach to Efficient Multi-Party Computation by Hazay, Carmit, Orsini, Emmanuela, Scholl, Peter, Soria-Vazquez, Eduardo

“…We present a new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting. Motivated by the fact…”
Get full text

Round-Optimal Secure Multi-party Computation by Halevi, Shai, Hazay, Carmit, Polychroniadou, Antigoni, Venkitasubramaniam, Muthuramakrishnan

“…Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of…”
Get full text

On the Power of Secure Two-Party Computation by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan

“…Ishai, Kushilevitz, Ostrovsky and Sahai (STOC 2007 ; SIAM J Comput 39(3):1121–1152, 2009 ) introduced the powerful “MPC-in-the-head” technique that provided a…”
Get full text

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model by Hazay, Carmit, Yanai, Avishay

“…The random-access memory model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important…”
Get full text

What Security Can We Achieve Within 4 Rounds? by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan

“…Katz and Ostrovsky (Crypto 2004) proved that five rounds are necessary for stand-alone general black-box constructions of secure two-party protocols and at…”
Get full text

On Black-Box Complexity of Universally Composable Security in the CRS Model by Hazay, Carmit, Venkitasubramaniam, Muthuramakrishnan

“…In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions . We present a…”
Get full text

Efficient Set Operations in the Presence of Malicious Adversaries by Hazay, Carmit, Nissim, Kobbi

“…We revisit the problem of constructing efficient secure two-party protocols for the problems of set intersection and set union, focusing on the model of…”
Get full text

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries by Hazay, Carmit, Toft, Tomas

“…We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t ∈{0,1} ∗ of length  n , while Bob has a pattern p ∈{0,1}…”
Get full text

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries by Hazay, Carmit, Lindell, Yehuda

“…In this paper, we construct efficient secure protocols for set intersection and pattern matching . Our protocols for secure computing the set intersection…”
Get full text

Efficient One-Sided Adaptively Secure Computation by Hazay, Carmit, Patra, Arpita

“…Adaptive security is a strong security notion that captures additional security threats that are not addressed by static corruptions. For instance, it captures…”
Get full text

Toward a Game Theoretic View of Secure Computation by Asharov, Gilad, Canetti, Ran, Hazay, Carmit

“…We demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of…”
Get full text