The following pages link to Joe Kilian (Q166360):
Displayed 49 items.
- Finding OR in a noisy broadcast network (Q294723) (← links)
- (Q676824) (redirect page) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Lower bounds for concurrent zero knowledge (Q812826) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions (Q1382146) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- The dynamic universality of sigmoidal neural networks (Q1923090) (← links)
- (Q2754171) (← links)
- (Q2757263) (← links)
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process (Q2811160) (← links)
- Two prover protocols (Q2817609) (← links)
- Primality testing using elliptic curves (Q3158545) (← links)
- More general completeness theorems for secure two-party computation (Q3191999) (← links)
- (Q3212276) (← links)
- How to Protect DES Against Exhaustive Key Search (Q3452356) (← links)
- A sublinear algorithm for weakly approximating edit distance (Q3581249) (← links)
- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting (Q3600375) (← links)
- (Q4035721) (← links)
- (Q4234094) (← links)
- (Q4249328) (← links)
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions (Q4250753) (← links)
- A Note on the Limits of Collusion-Resistant Watermarks (Q4250759) (← links)
- (Q4250778) (← links)
- (Q4259986) (← links)
- (Q4279564) (← links)
- (Q4318695) (← links)
- (Q4341757) (← links)
- (Q4343436) (← links)
- (Q4343444) (← links)
- (Q4474189) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)
- (Q4527017) (← links)
- (Q4527018) (← links)
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← links)
- (Q4940708) (← links)
- (Q4940713) (← links)
- Reducibility and Completeness in Private Computations (Q4943863) (← links)
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (Q5176014) (← links)
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (Q5176015) (← links)
- On Robust Combiners for Oblivious Transfer and Other Primitives (Q5385724) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428116) (← links)
- Fast Private Norm Estimation and Heavy Hitters (Q5445506) (← links)
- (Q5501239) (← links)
- Interactive Hashing: An Information Theoretic Tool (Invited Talk) (Q5502788) (← links)
- (Q5750398) (← links)
- How to protect DES against exhaustive key search (an analysis of DESX). (Q5927707) (← links)
- The security of the cipher block chaining message authentication code (Q5929912) (← links)