The following pages link to Jonathan Katz (Q1429028):
Displaying 50 items.
- (Q380960) (redirect page) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- Two-server password-only authenticated key exchange (Q414937) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Optimizing authenticated garbling for faster secure two-party computation (Q775980) (← links)
- Scalable protocols for authenticated group key exchange (Q882775) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- The mathematics and statistics of voting power (Q1429029) (← links)
- Provable security of (tweakable) block ciphers based on substitution-permutation networks (Q1673418) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Asynchronous Byzantine agreement with subquadratic communication (Q2055727) (← links)
- Universally composable relaxed password authenticated key exchange (Q2096488) (← links)
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy (Q2096625) (← links)
- Efficient 3-party distributed ORAM (Q2106641) (← links)
- On the security of time-lock puzzles and timed commitments (Q2119088) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Covert security with public verifiability: faster, leaner, and simpler (Q2292689) (← links)
- Constant-round group key exchange from the Ring-LWE assumption (Q2302133) (← links)
- Predicate encryption supporting disjunctions, polynomial equations, and inner products (Q2377068) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems (Q2463446) (← links)
- Characterization of security notions for probabilistic private-key encryption (Q2499267) (← links)
- Authenticated broadcast with a partially compromised public-key infrastructure (Q2637312) (← links)
- A forward-secure public-key encryption scheme (Q2642255) (← links)
- Efficient and non-interactive non-malleable commitment (Q2778839) (← links)
- (Q2778842) (← links)
- Hash Functions from Defective Ideal Ciphers (Q2790047) (← links)
- How fair is your protocol? A utility-based approach to protocol optimality (Q2796263) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose (Q2849384) (← links)
- Functional Encryption from (Small) Hardware Tokens (Q2867149) (← links)
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs (Q2874550) (← links)
- Amortizing Garbled Circuits (Q2874553) (← links)
- Efficient Three-Party Computation from Cut-and-Choose (Q2874556) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- On the Security of the “Free-XOR” Technique (Q2891475) (← links)
- Fair Computation with Rational Players (Q2894402) (← links)
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series (Q2900231) (← links)
- Collusion-Preserving Computation (Q2914257) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Distributing the setup in universally composable multi-party computation (Q2943608) (← links)
