The following pages link to Erez Petrank (Q812825):
Displaying 35 items.
- Lower bounds for concurrent zero knowledge (Q812826) (← links)
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols (Q916352) (← links)
- Quantifying knowledge complexity (Q1300608) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions (Q1382146) (← links)
- CBC MAC for real-time data sources (Q1573769) (← links)
- CBPQ: high performance lock-free priority queue (Q1693224) (← links)
- On the knowledge complexity of \(\mathcal N\mathcal P\) (Q1848028) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- Lower and upper bounds on obtaining history independence (Q2490116) (← links)
- Automated Verification of Practical Garbage Collectors (Q2786120) (← links)
- Computational complexity and knowledge complexity (extended abstract) (Q2817645) (← links)
- Black-box constructions for secure computation (Q2931374) (← links)
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858) (← links)
- Black-Box Constructions of Protocols for Secure Computation (Q3020005) (← links)
- Linear hash functions (Q3158554) (← links)
- (Q3369935) (← links)
- Computational Complexity and Knowledge Complexity (Q4210087) (← links)
- (Q4249328) (← links)
- Is code equivalence easy to decide? (Q4371902) (← links)
- (Q4417794) (← links)
- (Q4434873) (← links)
- (Q4474189) (← links)
- (Q4527014) (← links)
- (Q4527017) (← links)
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← 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)
- The hardness of cache conscious data placement (Q5178901) (← links)
- Passing Messages while Sharing Memory (Q5197667) (← links)
- Automated verification of practical garbage collectors (Q5261539) (← links)
- Space overhead bounds for dynamic memory management with partial compaction (Q5408567) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428116) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428135) (← links)
- (Q6083405) (← links)
