Handout 5 1 An Improved Upper-Bound on Circuit Size (2009)
Here we show the result promised in the previous lecture regarding an upper-bound on the size of circuits needed to compute any n-ary function. The key idea is to re-use prior computations whenever...
Recall that AC 0 is the set of languages/problems decided by constant-depth circuits (with unbounded fan-in) of polynomial size. (We allow circuits to have AND, OR, and NOT gates, and do not count...
Handout 8 1 Markov Chains and Random Walks on Graphs (2009)
Recall from last time that a random walk on a graph gave us an RL algorithm for the problem of undirected graph connectivity. In this class, we also saw an RP algorithm for solving 2-SAT (see [2,...
Compact Signatures for Network Coding (2009)
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. Since it does not require centralized control, network coding has been...
Which Languages Have 4-Round Zero-Knowledge Proofs? (2009)
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯ L ∈ MA. Assuming the polynomial hierarchy does not...
Composability and On-Line Deniability of Authentication (2009)
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but...
We show two lower bounds that are proved using related ideas. The results are not necessarily so interesting in their own right, but the proofs are interesting as rare examples in complexity theory...
Handout 7 1 More on Randomized Complexity Classes (2009)
Reminder: so far we have seen RP,coRP, and BPP. We introduce two more time-bounded
Lecture on Relativization (2009)
The main result of this lecture is to show the existence of oracles 1 A,B such that P A = N P A while P B ̸ = N P B. A fancy way of expressing this is to say that the P vs. N P question has...
Signing a Linear Subspace: Signature Schemes for Network Coding (2009)
Dan Boneh, David Freeman, Jonathan Katz
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires...
Signing a Linear Subspace: Signature Schemes for Network Coding (2009)
Dan Boneh, David Freeman, Jonathan Katz, Brent Waters
Abstract. Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding...
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008)
Jonathan Katz, Amit Sahai, Brent Waters
Abstract. Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts...
Notes on Complexity Theory Last updated: February, 2008 (2008)
We show here a probabilistically checkable proof for N P in which the verifier reads only a constant number of bits from the proof (and uses only a polynomial amount of randomness). The proof of this...
Lecture 7 1 More on Randomized Complexity Classes (2008)
Reminder: so far we have seen RP, coRP, and BPP. We introduce two more time-bounded
We show two lower bounds that are proved using related ideas. The results are not necessarily so interesting in their own right, but the proofs are interesting as rare examples in complexity theory...
Lecture 5 1 An Improved Upper-Bound on Circuit Size (2008)
Here we show the result promised in the previous lecture regarding an upper-bound on the size of circuits needed to compute any n-ary function. The key idea is to re-use prior computations whenever...
Bridging Game Theory and Cryptography: Recent Results and Future Directions (2008)
Abstract. Motivated by the desire to develop more realistic models of, and protocols for, interactions between mutually distrusting parties, there has recently been significant interest in combining...
Lecture 8 1 Markov Chains and Random Walks on Graphs (2008)
Recall from last time that a random walk on a graph gave us an RL algorithm for the problem of undirected graph connectivity. In this class, we also saw an RP algorithm for solving 2-SAT (see [2,...
Last time we introduced the class #P and defined #P-completeness. We continue with our discussion of the hardness of computing the permanent. 1.1 Computing the Permanent is #P-Complete The permanent...
For any complexity class C, we define the class coC as follows: coC def = � L | ¯ L ∈ C �. One class that is worth mentioning at this time is the class coN P. By definition, we have: coN P def...
Circuits are directed, acyclic graphs where nodes are called gates and edges are called wires. Input gates are gates with in-degree zero, and we will take the output gate of a circuit to be a gate...
It will be nice to find more “natural ” N P-complete languages. To that end, we define the language circuit-satisfiability (CS) as follows: Theorem 1 CS is N P-complete. CS = {C | C is a circuit,...
In this lecture, we will explore various consequences that follow if N P-complete languages are reducible to sparse languages (with different results for Karp reductions and (Cook-)Turing...
Universally Composable Password-Based Key (2008)
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell
Abstract. We propose and realize a definition of security for passwordbased key exchange within the framework of universally composable (UC) security, thus providing security guarantees under...
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008)
Jonathan Katz, Amit Sahai, Brent Waters
Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are...
Universally Composable Multi-Party Computation with an Unreliable Common Reference String ∗ (2008)
Universally composable (UC) multi-party computation has been studied in two settings. When a majority of parties are honest, UC multi-party computation is possible without any assumptions. Without a...
Universally Composable Multi-Party Computation with an Unreliable Common Reference String ⋆ (2008)
Abstract. Universally composable (UC) multi-party computation has been studied in two settings. When a majority of parties are honest, UC multi-party computation is possible without any assumptions....
Identity-Based Zero-Knowledge (2008)
Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely disseminate a proof...
On Achieving the "Best of Both Worlds " in Secure (2008)
Multiparty Computation, Jonathan Katz
As our main result, we completely settle the question by ruling out protocols using any(expected) polynomial number of rounds. Given this stark negative result, we then ask what can be achieved if we...
Efficient signature schemes with tight reductions to the Diffie-Hellman problems (2008)
Eu-jin Goh, Jonathan Katz, Nan Wang
We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. Security of our first scheme relies on the hardness...
Which Languages Have 4-Round Zero-Knowledge Proofs? (2008)
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯ L ∈ MA. Assuming the polynomial hierarchy does not...
Round Complexity of Authenticated Broadcast with a Dishonest Majority ∗ (2008)
Juan A. Garay, Jonathan Katz, Chiu-yuen Koo, Rafail Ostrovsky
Broadcast among n parties in the presence of t ≥ 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...
Cavan Reilly, Andrew Gelman, Jonathan Katz
We investigate the construction of more precise estimates of a collection of population means using information about a related variable in the context of repeated sample surveys. The method is...
E cient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2008)
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Abstract. There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a...
Identity-Based Zero-Knowledge (2008)
Jonathan Katz Rafail, Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely disseminate a proof of a...
The arts and democracy: A conversation with Dana Gioia (2008)
Dana Gioia, Chairman of the US National Endowment for the Arts, in an interview with Jonathan Katz, CEO of the National Assembly of State Arts Agencies, discusses the major challenges facing public...
Complete fairness in secure two-party computation (2008)
S. Dov Gordon, Carmit Hazay, Yehuda Lindell, Jonathan Katz
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...
Predicate encryption supporting disjunctions, polynomial equations, and inner products (2008)
Jonathan Katz, Amit Sahai, Brent Waters
Predicate encryption is a new paradigm for public-key encryption generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates...
Jonathan Katz, Steven Myers, Rafail Ostrovsky
Work done while the author was at Telcordia Technologies.
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Work done while at Columbia University Abstract. Password-only authenticated key exchange (PAKE) protocols are designed to be secure even when users choose short, easilyguessed passwords. Security...
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
Abstract. Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17]...
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Work done while at Columbia University Abstract. Password-only authenticated key exchange (PAKE) protocols are designed to be secure even when users choose short, easilyguessed passwords. Security...
Strong Key-Insulated Signature Schemes YEVGENIY DODIS (2007)
Digital signing is at the heart of Internet based transactions and e-commerce. In this global communication environment, signature computation will be frequently performed on a relatively insecure...
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
Abstract. Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17]...
Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be trusted...
On Message Integrity in Symmetric Encryption (2007)
Virgil D. Gligor, Pompiliu Donescu, Jonathan Katz
We extend the set of known message-integrity notions and define a lattice on this set using a typical "dominance " relation. The lattice integrity notions enables the precise...
Rosario Gennaro, Yael Gertner, Jonathan Katz
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 "...
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Telcordia Technologies Inc
Work done while the author was at Telcordia Technologies.
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Telcordia Technologies Inc
Work done while the author was at Telcordia Technologies.
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Abstract. There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a...
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Work done while the author was at Telcordia Technologies.
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Abstract. There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a...
Jonathan Katz, Steven Myers, Rafail Ostrovsky
Work done while the author was at Telcordia Technologies.
Round Eciency of Multi-Party Computation (2007)
With Dishonest Majority, Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Concurrently-secure blind signatures without random oracles or setup assumptions (2007)
Carmit Hazay, Jonathan Katz, Chiu-yuen Koo, Yehuda Lindell
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions...
Concurrently-secure blind signatures without random oracles or setup assumptions (2007)
Carmit Hazay, Jonathan Katz, Chiu-yuen Koo, Yehuda Lindell
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions...
Universally composable multi-party computation using tamper-proof hardware (2007)
Abstract. Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain ” model,...
Jonathan Katz, Chiu-yuen Koo, Ranjit Kumaresan
We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted parties t...
Round-efficient secure computation in point-to-point networks (2007)
Abstract. Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round...
Universally-composable two-party computation in two rounds (2007)
Abstract. Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show here a...
Concurrently-secure blind signatures without random oracles or setup assumptions (2007)
Carmit Hazay, Jonathan Katz, Chiu-yuen Koo, Yehuda Lindell
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions...
On achieving the “best of both worlds” in secure multiparty computation (2007)
Two settings are typically considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Protocols designed under this assumption...
U.S. Securities Regulation in a World of Global Exchanges (2006)
Aggarwal, Reena, Ferrell, Allen, Katz, Jonathan
Recently there has been a dramatic change in the organizational structure of exchanges as they have demutualized and converted into "for-profit" entities. This has been accompanied by a public...
U.S. Securities Regulation in a World of Global Exchanges (2006)
Aggarwal, Reena, Ferrell, Allen, Katz, Jonathan
Recently there has been a dramatic change in the organizational structure of exchanges as they have demutualized and converted into "for-profit" entities. This has been accompanied by a public...
KeyChains: A Decentralized Public-Key Infrastructure (2006)
Morselli, Ruggero, Bhattacharjee, Bobby, Katz, Jonathan, Marsh, Michael A.
A Certification Authority (CA) can be used to certify keys and build a public-key infrastructure (PKI) when all users trust the same CA. A decentralized PKI trades off absolute assurance on keys for...
KeyChains: A Decentralized Public-Key Infrastructure (2006)
Morselli, Ruggero, Bhattacharjee, Bobby, Katz, Jonathan, Marsh, Michael A.
A Certification Authority (CA) can be used to certify keys and build a public-key infrastructure (PKI) when all users trust the same CA. A decentralized PKI trades off absolute assurance on keys for...
Engineering Microorganisms for Energy Production (2006)
Brenner, Michael P., Bildsten, Lars, Dyson, Freeman, Fortson, Norval, Garwin, Richard, Grober, Robert, ...
JASON was asked by the Office of Biological and Environmental Research of the Department of Energy to assess the possibilities for using microorganisms to produce fuels as a metabolic product, in...
On Expected Constant-Round Protocols for Byzantine Agreement (2006)
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t n/3 malicious parties that runs in expected constant rounds. Here, we show an expected...
Analyzing the HB and HB (2006)
In The Large, Jonathan Katz, Adam Smith
HB and HB are two shared-key, unidirectional authentication protocols whose extremely low computational cost makes them potentially well-suited for severely resource-constrained devices. Security of...
On expected constant-round protocols for Byzantine agreement (2006)
Abstract In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreementprotocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here,we show...
On expected constant-round protocols for Byzantine agreement (2006)
In a seminal paper, Feldman and Micali have shown an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, resolving a question...
On expected constant-round protocols for Byzantine agreement (2006)
In a seminal paper, Feldman and Micali (STOC ’88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. Here, we show an...
Ring signatures: Stronger definitions, and constructions without random oracles (2006)
Adam Bender, Jonathan Katz, Ruggero Morselli
Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing...
Parallel and concurrent security of the HB and HB+ protocols (2006)
Juels and Weis (building on prior work of Hopper and Blum) propose and analyze two shared-key authentication protocols — HB and HB + — whose extremely low computational cost makes them attractive...
Efficient and secure authenticated key exchange using weak passwords (2006)
Jonathan Katz, Rafail Ostrovsky, Moti Yung
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...
Ring signatures: Stronger definitions, and constructions without random oracles (2006)
Adam Bender, Jonathan Katz, Ruggero Morselli
Ring signatures, first introduced by Rivest, Shamir, and Tauman, enable a user to sign a message so that a ring of possible signers (of which the user is a member) is identified, without revealing...
Parallel and concurrent security of the HB and HB+ protocols (2006)
Jonathan Katz, Ji Sun, Shin Adam Smith
Juels and Weis, building on prior work of Hopper and Blum, propose and analyze two sharedkey authentication protocols — HB and HB + — whose extremely low computational cost makes them attractive...
Robust fuzzy extractors and authenticated key agreement from close secrets (2006)
Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin
Abstract. Consider two parties holding correlated random variables W and W ′ , respectively, that are within distance t of each other in some metric space. These parties wish to agree on a...
On expected constant-round protocols for Byzantine agreement (2006)
In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds. Here,...
Harte, Alison L., McTernan, Philip G., Chetty, Rajkumar, Coppack, Simon, Katz, Jonathan, Smith, Stephen, ...
Background: Obesity associated hypertension is likely to be due to multiple mechanisms. Identification of the renin-angiotensin system (RAS) within adipose tissue does, however, suggest a potential...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
We show two efficient techniques enabling the use of biometric data to achieve mutual authentication or authenticated key exchange over a completely insecure (i.e., adversarially controlled) channel....
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
Abstract. Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. Here, we revisit the following...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
secret information that can be used incryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly distributed; and (2) they are not exactly reproducible. Recent...
A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks (2005)
Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod Varshney, Jonathan Katz, Aram Khalili
this paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network...
Secure Remote Authentication Using Biometric Data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data o#er a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Modeling Insider Attacks on Group Key-Exchange Protocols (2005)
Protocols for authenticated key exchange (AKE) allow a group of parties within an insecure network to establish a common session key which can then be used to secure their future communication.
On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions (2005)
A fundamental result in cryptography is that a digital signature scheme can be constructed from an arbitrary one-way function. A proof of this somewhat surprising statement follows from two results:...
Parallel and Concurrent Security of the (2005)
Hb And Hb, Jonathan Katz, Ji Sun Shin
Juels and Weis (building on prior work of Hopper and Blum) propose and analyze two shared-key authentication protocols --- HB and HB --- whose extremely low computational cost makes them attractive...
Bounds on the efficiency of “black-box” commitment schemes (2005)
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theoretic) assumptions....
Improved efficiency for cca-secure cryptosystems built using identity-based encryption (2005)
Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption schemes from identity-based encryption schemes in the standard model. We improve the efficiency of...
Secure Remote Authentication Using Biometric (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometrics offer a potential source of high-entropy, secret information. Before such data can be used in cryptographic protocols, however, two issues must be addressed: biometric data (1) are not...
On reliable broadcast in a radio network (2005)
Chiu-yuen Koo, Jonathan Katz, Vartika Bhandari, Nitin H. Vaidya
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...
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also considered. For...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli
Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. For most — but not all! —...
Improved efficiency for cca-secure cryptosystems built using identity-based encryption (2005)
Abstract. Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption schemes from identity-based encryption schemes in the standard model. We improve the...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way...
Universally composable password-based key exchange (2005)
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip Mackenzie
Abstract We propose and realize a definition of security for password-based key exchange within theframework of universal composability (UC), thus providing security guarantees under arbitrary...
Two-Server Password-Only Authenticated Key Exchange (2005)
Jonathan Katz, Philip Mackenzie, Gelareh Taban, Virgil Gligor
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, an inherent...
Modeling Insider Attacks on Group Key-Exchange Protocols (2005)
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...
Two-Server Password-Only Authenticated Key Exchange (2005)
Jonathan Katz, Philip Mackenzie, Gelareh Taban, Virgil Gligor
Abstract. Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, an inherent...
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also considered. For...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
Abstract. Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. Here, we revisit the following...
Universally composable password-based key exchange (2005)
Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip Mackenzie
Abstract We propose and realize a definition of security for password-based key exchange within theframework of universal composability (UC), thus providing security guarantees under arbitrary...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Two-Server Password-Only Authenticated Key Exchange (2005)
Jonathan Katz, Philip Mackenzie, Gelareh Taban, Virgil Gligor
Abstract. Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, an inherent...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not...
Reducing complexity assumptions for statistically-hiding commitment (2005)
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli, Ronen Shaltiel
Abstract. Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. Here, we revisit the following...
Two-server password-only authenticated key exchange (2005)
Jonathan Katz, Philip Mackenzie, Gelareh Taban, Virgil Gligor
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, an inherent...
Trust-preserving set operations (2004)
Ruggero Morselli, Bobby Bhattacharjee, Jonathan Katz, Pete Keleher
Abstract — We describe a method of performing trustpreserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing contentbased search results in...
One-Round Protocols for Two-Party Authenticated Key Exchange (2004)
Ik Rae Jeong, Jonathan Katz, Dong Hoon Lee
Abstract. Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In...
Trust-preserving set operations (2004)
Ruggero Morselli, Bobby Bhattacharjee, Jonathan Katz, Pete Keleher
Abstract — We describe a method of performing trustpreserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing contentbased search results in...
Round-optimal secure two-party computation (2004)
Abstract. We consider the central cryptographic task of secure twoparty computation: two parties wish to compute some function of their private inputs (each receiving possibly di#erent outputs) where...
Round-optimal secure two-party computation (2004)
Jonathan Katz, Rafail Ostrovsky
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibly different...
Chosen-ciphertext security from identity-based encryption (2004)
Ran Canetti, Shai Halevi, Jonathan Katz
We show how to construct a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our conversion from an IBE scheme to a CCA-secure scheme is simple,...
Trust-Preserving Set Operations (2004)
Ruggero Morselli, Bobby Bhattacharjee, Jonathan Katz, Pete Keleher
We describe a method for performing trustpreserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer...
A Game-Theoretic Framework for Analyzing Trust-Inference Protocols (2004)
Ruggero Morselli, Jonathan Katz, Bobby Bhattacharjee
We propose a novel game-theoretic framework for analyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the...
Reducing Complexity Assumptions for Statistically-Hiding Commitment (2004)
Omer Horvitz, Jonathan Katz, Chiu-yuen Koo, Ruggero Morselli
Determining the minimal assumptions needed to construct various cryptographic building blocks has been a focal point of research in theoretical cryptography. For most --- but not all! ---...
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption (2004)
Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption schemes from identity-based encryption schemes in the standard model. We improve the efficiency of...
Adaptively-Secure, Non-Interactive Public-Key Encryption (2004)
Ran Canetti, Shai Halevi, Jonathan Katz
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of...
A Game-Theoretic Framework for Analyzing Trust-Inference Protocols (2004)
Ruggero Morselli, Jonathan Katz, Bobby Bhattacharjee
We propose a novel game-theoretic framework for analyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the...
Ran Canetti, Shai Halevi, Jonathan Katz
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of...
Chosen-ciphertext security from identity-based encryption (2004)
Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz
We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our...
A generic construction for intrusion-resilient public-key encryption (2004)
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji
Abstract. In an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can...
Chosen-ciphertext security from identity-based encryption (2004)
Ran Canetti, Shai Halevi, Jonathan Katz
We show how to construct a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our conversion from an IBE scheme to a CCA-secure scheme is simple,...
Adaptively-Secure, Non-Interactive Public-Key Encryption (2004)
Ran Canetti, Shai Halevi, Jonathan Katz
Abstract. Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of...
A game-theoretic framework for analyzing trust-inference protocols (2004)
Ruggero Morselli, Jonathan Katz, Bobby Bhattacharjee
We propose a novel game-theoretic framework for analyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the...
Chosen-ciphertext security from identity-based encryption (2004)
Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz
We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. Our...
Round-optimal secure two-party computation (2004)
Jonathan Katz, Rafail Ostrovsky
Abstract. We consider the central cryptographic task of secure twoparty computation: two parties wish to compute some function of their private inputs (each receiving possibly different outputs)...
A game-theoretic framework for analyzing trust-inference protocols (2004)
Ruggero Morselli, Jonathan Katz, Bobby Bhattacharjee
We propose a novel game-theoretic framework for analyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the...
A Game-Theoretic Framework for Analyzing Trust-Inference Protocols (2004)
Ruggero Morselli, Jonathan Katz, Bobby Bhattacharjee
We propose a novel game-theoretic framework for analyzing the robustness of trust-inference protocols in the presence of adversarial (but rational) users. To the best of our knowledge, this is the...
Chosen-Ciphertext Security from Identity-Based Encryption (2004)
Ran Canetti, Shai Halevi, Jonathan Katz
We propose a simple and e#cient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction requires the underlying IBE...
Trust-Preserving Set Operations (2003)
Morselli, Ruggero, Bhattacharjee, Bobby, Katz, Jonathan, Keleher, Pete
We describe a method of performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer...
Trust-Preserving Set Operations (2003)
Morselli, Ruggero, Bhattacharjee, Bobby, Katz, Jonathan, Keleher, Pete
We describe a method of performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003)
Abstract. We describe e#cient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important...
A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks (2003)
Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili
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...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
A forward-secure public-key encryption scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Abstract. Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an effort to mitigate the damage...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Strong Key-Insulated Signature Schemes (2003)
Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
Signature computation is frequently performed on insecure devices--- e.g., mobile phones---operating in an environment where the private (signing) key is likely to be exposed. Strong keyinsulated...
A forward-secure public-key encryption scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Abstract. Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage...
A Forward-Secure Public-Key Encryption Scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage caused by...
Trust-Preserving Set Operations (2003)
Ruggero Morselli Bobby, Bobby Bhattacharjee, Jonathan Katz, Pete Keleher
We describe a method for performing trustpreserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer...
Scalable Protocols for Authenticated Group Key Exchange (2003)
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however,...
Lower Bounds on the Efficiency of Encryption and Digital Signature Schemes (2003)
Rosario Gennaro, Yael Gertner, Jonathan Katz
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...
Trust-Preserving Set Operations (2003)
Ruggero Morselli Bobby, Bobby Bhattacharjee, Jonathan Katz, Pete Keleher
We describe a method of performing trustpreserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing contentbased search results in peer-to-peer...
Scalable Protocols for Authenticated Group Key Exchange (2003)
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however,...
Binary Tree Encryption: Constructions and Applications (2003)
Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the definition of security for...
A Forward-Secure Public-Key Encryption Scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage caused by...
Efficiency Improvements for Signature Schemes with Tight Security Reductions (2003)
Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in...
Efficiency Improvements for Signature Schemes with Tight Security Reductions (2003)
Much recent work has focused on constructing e#cient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in...
Scalable Protocols for Authenticated Group Key Exchange (2003)
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Toward Secure Key Distribution in Truly Ad-Hoc Networks (2003)
Aram Khalili Jonathan, Jonathan Katz, William A. Arbaugh
Ad-hoc networks --- and in particular wireless mobile ad-hoc networks --- have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003)
We describe very efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El-Gamal encryption schemes whose security can be proven in the...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003)
Abstract We describe very efficient protocols for non-malleable (interactive) proofs of plain-text knowledge for the RSA, Rabin, Paillier, and El-Gamal encryption schemes whose security can be proven...
Scalable Protocols for Authenticated Group Key Exchange (2003)
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have been proposed; however,...
A forward-secure public-key encryption scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the damage caused by...
A forward-secure public-key encryption scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Abstract Cryptographic computations are often carried out on insecure devices for which the threatof key exposure represents a serious and realistic concern. In an effort to mitigate the damage
A forward-secure public-key encryption scheme (2003)
Ran Canetti, Shai Halevi, Jonathan Katz
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an effort to mitigate the damage caused by...
A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks (2003)
Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili
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...
A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks (2003)
Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili
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...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003)
Abstract. We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important...
Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications (2003)
Abstract. We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important...
Efficient cryptographic protocols preventing 'man-in-the-middle' attacks (2002)
In the analysis of many cryptographie protocole, it is useful to distinguish two classes of attacks: passive attacks in which an adversary eavesdrops on messages sent between honest users and active...
Key-insulated public key cryptosystems (2002)
Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
Abstract. Cryptographic computations (decryption, signature generation, etc.) are often performed on a relatively insecure device (e.g., a mobile device or an Internet-connected host) which cannot be...
Threshold cryptosystems based on factoring (2002)
3 Work done while at Columbia University and Telcordia Technologies Abstract. We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants...
A forward-secure public-key encryption scheme. Cryptology ePrint Archive, Report 2002/060 (2002)
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious and realistic concern. In an e#ort to mitigate the damage caused by...
Threshold cryptosystems based on factoring (2002)
We consider distributed (threshold) cryptosystems over a composite modulus N in which the factors of N are shared among the participants as the secret key. This is a new idea for threshold...
Strong Key-Insulated Signature Schemes (2002)
Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung
Signature computation is frequently performed on insecure devices --- e.g., mobile phones --- operating in an environment where the private (signing) key is likely to be exposed. Strong key-insulated...
Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks (2002)
In the analysis of many cryptographic protocols, it is useful to distinguish two classes of attacks: passive attacks in which an adversary eavesdrops on messages sent between honest users and active...
Threshold cryptosystems based on factoring (2002)
Abstract We consider threshold cryptosystems over a composite modulus N where the fac-tors of N are shared among the participants as the secret key. This is a new paradigmfor threshold cryptosystems...
Threshold cryptosystems based on factoring (2002)
We consider threshold cryptosystems over a composite modulus N where the factors of N are shared among the participants as the secret key. This is a new paradigm for threshold cryptosystems based on...
Implementation of chosen-ciphertext attacks against PGP and GnuPG (2002)
Kahil Jallad, Jonathan Katz, Jena J. Lee, Bruce Schneier
Abstract. We recently noted [6] that PGP and other e-mail encryption protocols are, in theory, highly vulnerable to chosen-ciphertext attacks in which the recipient of the e-mail acts as an unwitting...
Implementation of chosen-ciphertext attacks against PGP and GnuPG (2002)
Kahil Jallad, Jonathan Katz, Bruce Schneier
4 Work done while at Columbia University Abstract. We recently noted [6] that PGP and other e-mail encryption protocols are, in theory, highly vulnerable to chosen-ciphertext attacks in which the...
Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks (2002)
In the analysis of many cryptographic protocols, it is useful to distinguish two classes of attacks: passive attacks in which an adversary eavesdrops on messages sent between honest users and active...
Efficient cryptographic protocols preventing "Man-in-the-Middle" attacks (2002)
Department: Computer Science.
Efficient password-authenticated key exchange using human-memorable passwords (2001)
Jonathan Katz, Rafail Ostrovsky, Moti Yung
Abstract. There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a...
Cryptographic counters and applications to electronic voting (2001)
Jonathan Katz, Steven Myers, Rafail Ostrovsky
Abstract. We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately...
Cryptographic counters and applications to electronic voting (2001)
Jonathan Katz, Steven Myers, Rafail Ostrovsky
Abstract. We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately...
A Chosen Ciphertext Attack against Several E-Mail Encryption Protocols (2000)
Several security protocols (PGP, PEM, MOSS, S/MIME, PKCS#7, CMS, etc.) have been developed to provide confidentiality and authentication of electronic mail. These protocols are widely used and...
Lower bounds on the Efficiency of Generic Cryptographic Constructions (2000)
Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan
A central focus of modern cryptography is the construction of efficient, "high-level" cryptographic tools (e.g., encryption schemes) from weaker, "low-level" cryptographic...
A Practical Statistical Model for Multiparty Electoral Data (2000)
James Honaker, Jonathan Katz, Gary King
Katz and King (1999) develop a model for predicting or explaining aggregate electoral results in multiparty democracies. Their model is, in principle, analogous to what least squares regression...
Bounds on the Efficiency of Generic Cryptographic Constructions (2000)
Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan
A central focus of modern cryptography is the construction of efficient, "high-level" cryptographic tools (e.g., encryption schemes) from weaker, "low-level" cryptographic...
Complete characterization of security notions for probabilistic private-key encryption (2000)
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus...
Typescript.
Replication data for: A Statistical Model of Multiparty Electoral Data (1999)
We propose a comprehensive statistical model for analyzing multiparty, district-level elections. This model, which provides a tool for comparative politics research analagous to that which regression...
Turbulent Boundary-Layer Drag Reduction (1998)
Dimotakis, Paul, Diamond, Patrick, Dyson, Freeman, Hammer, David, Katz, Jonathan
This study was sponsored by DARPA, in the wake of ONR-sponsored JASON Study JSR-99-215 on Fast Transoceanic Transport (aka, "Fast Ships" study). The charge for this study is to focus on turbulent...
Hammer, David, Bildsten, Lars, Abarbanel, Henry, Cornwall, John, Eardley, Douglas, Happer, Will, ...
JASON was asked by the National Nuclear Security Administration (NNSA) to assess the plan and prospects for achieving inertial confinement fusion (ICF) ignition at the National Ignition Facility...
Thesis (Ph. D.)--Kent State University, 1997.
Thesis (Ph. D.)--Kent State University, 1997.
We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly...
Implementing development and manpower strategies in Boston, Chicago and Philadelphia / (1980)
Katz, Jonathan., United States. Employment And Training Administration.
Cover title.
Auchter, Bernard, Katz, Jonathan, Graham, Mary
"United States Discussion Paper for the Sixth United Nations Congress on the Prevention of Crime and the Treatment of Offenders"
Katz, Jonathan., United States. Employment And Training Administration.
"This report was prepared for the Employment and Training Administration, U.S. Department of Labor, under research and development grant no. 91-25-79-32."
Unforgeable encryption and chosen ciphertext secure modes of operation (1978)
Abstract. We find certain neglected issues in the study of private-key encryption schemes. For one, private-key encryption is generally held to the same standard of security as public-key encryption...
Kaestner, Klaus H., Katz, Jonathan, Liu, Yuanfang, Drucker, Daniel J., Schütz, Günther
Mice homozygous for a null mutation in the winged helix transcription factor HNF3α showed severe postnatal growth retardation followed by death between P2 and P12. Homozygous mutant mice were...
Wu, Kai-Da, Cho, Young Shin, Katz, Jonathan, Ponomarev, Vladimir, Chen-Kiang, Selina, Danishefsky, Samuel J., ...
26-Trifluoro-(E)-9,10-dehydro-12,13-desoxyepothilone B [Fludelone (Flu)] has shown broad antitumor activity in solid tumor models. In the present study, we showed, in vitro, that Flu significantly...
Kaestner, Klaus H., Katz, Jonathan, Liu, Yuanfang, Drucker, Daniel J., Schütz, Günther
Mice homozygous for a null mutation in the winged helix transcription factor HNF3α showed severe postnatal growth retardation followed by death between P2 and P12. Homozygous mutant mice were...
Wu, Kai-Da, Cho, Young Shin, Katz, Jonathan, Ponomarev, Vladimir, Chen-Kiang, Selina, Danishefsky, Samuel J., ...
26-Trifluoro-(E)-9,10-dehydro-12,13-desoxyepothilone B [Fludelone (Flu)] has shown broad antitumor activity in solid tumor models. In the present study, we showed, in vitro, that Flu significantly...
Throwing Out the Baby with the Bath Water: A Comment on Green, Kim, and Yoon
Beck, Nathaniel N., Katz, Jonathan
Donald P. Green, Soo Yeon Kim, and David H. Yoon contribute to theliterature on estimating pooled times-series cross-section models ininternational relations (IR). They argue that such models should...
Lühder, Fred, Katz, Jonathan, Benoist, Christophe, Mathis, Diane
Insulin-dependent diabetes is heavily influenced by genes encoded within the major histocompatibility complex (MHC), positively by some class II alleles and negatively by others. We have explored the...
Beyond Ordinary Logit: Taking Time Seriously in Binary Time-Series-Cross-Section Models
Beck, Nathaniel, Katz, Jonathan, Tucker, Richard
Researchers typically analyze time-series{cross-section data with a binary dependent variable (BTSCS) using ordinary logit or probit. However, BTSCS observations are likely to violate the...
Throwing Out the Baby with the Bath Water: A Comment on Green, Kim, and Yoon
Beck, Nathaniel N., Katz, Jonathan
Donald P. Green, Soo Yeon Kim, and David H. Yoon contribute to theliterature on estimating pooled times-series cross-section models ininternational relations (IR). They argue that such models should...
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus...