The following pages link to Jonathan Katz (Q1429028):
Displaying 45 items.
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Efficient, Reusable Fuzzy Extractors from LWE (Q5082200) (← links)
- Introduction to Modern Cryptography (Q5134507) (← links)
- Reliable broadcast in radio networks (Q5177287) (← links)
- Multi-Client Verifiable Computation with Stronger Security Guarantees (Q5261673) (← links)
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds (Q5261692) (← links)
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (Q5267415) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307255) (← links)
- (Q5310362) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311543) (← links)
- Reducing Complexity Assumptions for Statistically-Hiding Commitment (Q5385722) (← links)
- Universally Composable Password-Based Key Exchange (Q5385742) (← links)
- Complete Fairness in Secure Two-Party Computation (Q5395668) (← links)
- Verifiable Oblivious Storage (Q5402968) (← links)
- Multi-input Functional Encryption (Q5418717) (← links)
- Chosen‐Ciphertext Security from Identity‐Based Encryption (Q5422487) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428114) (← links)
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware (Q5429386) (← links)
- Round-Efficient Secure Computation in Point-to-Point Networks (Q5429398) (← links)
- Which Languages Have 4-Round Zero-Knowledge Proofs? (Q5445499) (← links)
- Universally Composable Multi-party Computation with an Unreliable Common Reference String (Q5445503) (← links)
- Bridging Game Theory and Cryptography: Recent Results and Future Directions (Q5445510) (← links)
- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise (Q5447505) (← links)
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (Q5458590) (← links)
- Aggregate Message Authentication Codes (Q5458938) (← links)
- Security in Communication Networks (Q5491698) (← links)
- Bounds on the Efficiency of Generic Cryptographic Constructions (Q5700578) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710852) (← links)
- Theory of Cryptography (Q5711643) (← links)
- Theory of Cryptography (Q5711671) (← links)
- Theory of Cryptography (Q5711672) (← links)
- Information Security and Cryptology - ICISC 2003 (Q5714114) (← links)
- Automata, Languages and Programming (Q5716759) (← links)
- 10-Round Feistel is Indifferentiable from an Ideal Cipher (Q5739218) (← links)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens (Q5746357) (← links)
- On Expected Constant-Round Protocols for Byzantine Agreement (Q5756649) (← links)
- Theory of Cryptography (Q5898642) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901686) (← links)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
- Boosting the Security of Blind Signature Schemes (Q6041294) (← links)
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions (Q6157530) (← links)
- Algebraic adversaries in the universal composability framework (Q6157553) (← links)
- An analysis of the algebraic group model (Q6175979) (← links)
- Latke: a framework for constructing identity-binding PAKEs (Q6648206) (← links)
