Search For:

Displaying 1-25 out of 25 total
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries
Found in: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
By Juan Garay,Jonathan Katz,Ueli Maurer,Bjorn Tackmann,Vassilis Zikas
Issue Date:October 2013
pp. 648-657
Existing work on
 
Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy
Found in: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
By Raef Bassily,Adam Groce,Jonathan Katz,Adam Smith
Issue Date:October 2013
pp. 439-448
We propose a new framework for defining privacy in statistical databases that enables reasoning about and exploiting adversarial uncertainty about the data. Roughly, our framework requires indistinguishability of the real world in which a mechanism is comp...
 
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan
Issue Date:October 2010
pp. 501-510
In recent years, there has been a major effort to design cryptographic schemes that remain secure even when arbitrary information about the secret key is leaked (e.g., via side-channel attacks). We explore the possibility of achieving security under \emph{...
 
Round Complexity of Authenticated Broadcast with a Dishonest Majority
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky
Issue Date:October 2007
pp. 658-668
<p>Broadcast among n parties in the presence of t \geqslant n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure digital signatures, where so-called authenticated bro...
 
Toward Secure Key Distribution in Truly Ad-Hoc Networks
Found in: Applications and the Internet Workshops, IEEE/IPSJ International Symposium on
By Aram Khalili, Jonathan Katz, William A. Arbaugh
Issue Date:January 2003
pp. 342
Ad-hoc network - and in particular wireless mobile ad-hoc network - have unique characteristic and constraint that make traditional cryptographic mechanisms and assumptions inappropriate. In particular, it may not be warranted to assume pre-existing shared...
 
Anon-Pass: Practical Anonymous Subscriptions
Found in: IEEE Security & Privacy
By Michael Z. Lee,Alan M. Dunn,Jonathan Katz,Brent Waters,Emmett Witchel
Issue Date:May 2014
pp. 20-27
nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull...
 
Anon-Pass: Practical Anonymous Subscriptions
Found in: IEEE Security & Privacy
By Michael Lee,Alan Dunn,Jonathan Katz,Brent Waters,Emmett Witchel
Issue Date:December 2013
pp. 1
We present Anon-Pass, a protocol and system for anonymous subscription services that allow users to anonymously authenticate while preventing mass sharing of credentials. Service providers cannot correlate users' actions, yet service providers are guarante...
 
Authenticated data structures, generically
Found in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '14)
By Andrew Miller, Elaine Shi, Jonathan Katz, Michael Hicks
Issue Date:January 2014
pp. 411-423
An authenticated data structure (ADS) is a data structure whose operations can be carried out by an untrusted prover, the results of which a verifier can efficiently check as authentic. This is done by having the prover produce a compact proof that the ver...
     
Brief announcement: a game-theoretic model motivated by the darpa network challenge
Found in: Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures (SPAA '13)
By Jonathan Katz, Koyel Mukherjee, MohammadTaghi Hajiaghayi, Rajesh Chitnis
Issue Date:July 2013
pp. 115-118
In this paper we propose a game-theoretic model to analyze events similar to the 2009 DARPA Network Challenge, which was organized by the Defense Advanced Research Projects Agency (DARPA) for exploring the roles that the Internet and social networks play i...
     
Secure two-party computation in sublinear (amortized) time
Found in: Proceedings of the 2012 ACM conference on Computer and communications security (CCS '12)
By Fernando Krell, Jonathan Katz, Mariana Raykova, S. Dov Gordon, Tal Malkin, Vladimir Kolesnikov, Yevgeniy Vahlis
Issue Date:October 2012
pp. 513-524
Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f depends on each of its input bits, this implies a protocol with complexity at least linear in the input size. In fact, linear runnin...
     
Knowledge-oriented secure multiparty computation
Found in: Proceedings of the 7th Workshop on Programming Languages and Analysis for Security (PLAS '12)
By Jonathan Katz, Michael Hicks, Mudhakar Srivatsa, Piotr Mardziel
Issue Date:June 2012
pp. 1-12
Protocols for secure multiparty computation (SMC) allow a set of mutually distrusting parties to compute a function f of their private inputs while revealing nothing about their inputs beyond what is implied by the result. Depending on f, however, the resu...
     
Complete Fairness in Secure Two-Party Computation
Found in: Journal of the ACM (JACM)
By Carmit Hazay, Jonathan Katz, S. Dov Gordon, Yehuda Lindell
Issue Date:December 2011
pp. 1-37
In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable prope...
     
Adaptively secure broadcast, revisited
Found in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC '11)
By Hong-Sheng Zhou, Jonathan Katz, Juan A. Garay, Ranjit Kumaresan
Issue Date:June 2011
pp. 179-186
We consider the classical problem of synchronous broadcast with dishonest majority, when a public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols...
     
A new framework for efficient password-based authenticated key exchange
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Adam Groce, Jonathan Katz
Issue Date:October 2010
pp. 516-525
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-lin...
     
Secure text processing with applications to private DNA matching
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Jonathan Katz, Lior Malka
Issue Date:October 2010
pp. 485-492
Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to lear...
     
Attacking cryptographic schemes based on "perturbation polynomials"
Found in: Proceedings of the 16th ACM conference on Computer and communications security (CCS '09)
By Craig Gentry, Jonathan Katz, Martin Albrecht, Shai Halevi
Issue Date:November 2009
pp. 1-10
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use "perturbation polynomials" to add "noise" to polynomialbased systems that off...
     
Efficient and secure authenticated key exchange using weak passwords
Found in: Journal of the ACM (JACM)
By Jonathan Katz, Moti Yung, Rafail Ostrovsky
Issue Date:November 2009
pp. 1-39
Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryp...
     
Complete fairness in secure two-party computation
Found in: Proceedings of the 40th annual ACM symposium on Theory of computing (STOC '08)
By Dov S. Gordon, Hazay Carmit, Jonathan Katz, Yehuda Lindell
Issue Date:May 2008
pp. 13-14
In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable prope...
     
On achieving the "best of both worlds" in secure multiparty computation
Found in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (STOC '07)
By Jonathan Katz
Issue Date:June 2007
pp. 11-20
Two settings are typically considered for secure multipartycomputation, depending on whether or not a majority of the partiesare assumed to be honest. Protocols designed under this assumptionprovide "full security" (and, in particular, guarantee outputdeli...
     
Reliable broadcast in radio networks: the bounded collision case
Found in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC '06)
By Chiu-Yuen Koo, Jonathan Katz, Nitin H. Vaidya, Vartika Bhandari
Issue Date:July 2006
pp. 258-264
We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work as...
     
Modeling insider attacks on group key-exchange protocols
Found in: Proceedings of the 12th ACM conference on Computer and communications security (CCS '05)
By Ji Sun Shin, Jonathan Katz
Issue Date:November 2005
pp. 180-189
Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. It is fair to say that group AKE is currently less well understood than t...
     
A pairwise key predistribution scheme for wireless sensor networks
Found in: ACM Transactions on Information and System Security (TISSEC)
By Aram Khalili, Jing Deng, Jonathan Katz, Pramod K. Varshney, Wenliang Du, Yunghsiang S. Han
Issue Date:May 2005
pp. 228-258
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties....
     
Lower bounds on the efficiency of encryption and digital signature schemes
Found in: Proceedings of the thirty-fifth ACM symposium on Theory of computing (STOC '03)
By Jonathan Katz, Rosario Gennaro, Yael Gertner
Issue Date:June 2003
pp. 417-425
A central focus of modern cryptography is to investigate the weakest possible assumptions under which various cryptographic algorithms exist. Typically, a proof that a "weak" primitive (e.g., a one-way function) implies the existence of a "strong" algorith...
     
Complete characterization of security notions for probabilistic private-key encryption
Found in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (STOC '00)
By Jonathan Katz, Moti Yung
Issue Date:May 2000
pp. 245-254
We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint v...
     
On the efficiency of local decoding procedures for error-correcting codes
Found in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (STOC '00)
By Jonathan Katz, Luca Trevisan
Issue Date:May 2000
pp. 80-86
We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint v...
     
 1