The following pages link to Jonathan Katz (Q1429028):
Displaying 50 items.
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858) (← links)
- Round-Optimal Password-Based Authenticated Key Exchange (Q3000545) (← links)
- Limits of Computational Differential Privacy in the Client/Server Setting (Q3000553) (← links)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions (Q3000564) (← links)
- Impossibility of Blind Signatures from One-Way Permutations (Q3000567) (← links)
- Incremental Unforgeable Encryption (Q3046596) (← links)
- A Group Signature Scheme from Lattice Assumptions (Q3058668) (← links)
- Constant-Round Private Function Evaluation with Linear Complexity (Q3102210) (← links)
- (Q3149675) (← links)
- Byzantine Agreement with a Rational Adversary (Q3167044) (← links)
- Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
- (Q3191615) (← links)
- On the efficiency of local decoding procedures for error-correcting codes (Q3191974) (← links)
- Complete characterization of security notions for probabilistic private-key encryption (Q3191991) (← links)
- Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
- Efficient and secure authenticated key exchange using weak passwords (Q3455565) (← links)
- Improving the Round Complexity of VSS in Point-to-Point Networks (Q3519526) (← links)
- How to Encrypt with a Malicious Random Number Generator (Q3525681) (← links)
- Rational Secret Sharing, Revisited (Q3541890) (← links)
- (Q3549592) (← links)
- (Q3549726) (← links)
- Secure Network Coding over the Integers (Q3562893) (← links)
- Partial Fairness in Secure Two-Party Computation (Q3563834) (← links)
- Lower bounds on the efficiency of encryption and digital signature schemes (Q3581302) (← links)
- Parallel and Concurrent Security of the HB and HB + Protocols (Q3593090) (← links)
- Two-Server Password-Only Authenticated Key Exchange (Q3593122) (← links)
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions (Q3596389) (← links)
- Digital Signatures (Q3605089) (← links)
- Complete Fairness in Multi-party Computation without an Honest Majority (Q3611756) (← links)
- Universally-Composable Two-Party Computation in Two Rounds (Q3612546) (← links)
- Signing a Linear Subspace: Signature Schemes for Network Coding (Q3617513) (← links)
- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations (Q3650693) (← links)
- Proofs of Storage from Homomorphic Identification Protocols (Q3650700) (← links)
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices (Q3650718) (← links)
- Signature Schemes with Bounded Leakage Resilience (Q3650722) (← links)
- (Q4408421) (← links)
- Threshold Cryptosystems Based on Factoring (Q4412798) (← links)
- (Q4414266) (← links)
- Strong Key-Insulated Signature Schemes (Q4414703) (← links)
- (Q4418524) (← links)
- (Q4434877) (← links)
- (Q4434880) (← links)
- (Q4536198) (← links)
- (Q4737236) (← links)
- Poststratification Without Population Level Information on the Poststratifying Variable With Application to Political Polling (Q4808054) (← links)
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World (Q4910283) (← links)
- Universally Composable Synchronous Computation (Q4910294) (← links)
- Multi-Client Non-interactive Verifiable Computation (Q4910295) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
