Erez Petrank

Available identifiers

zbMath Open petrank.erezDBLP29/3287WikidataQ5385748 ScholiaQ5385748MaRDI QIDQ812825

List of research outcomes

Publication	Date of Publication	Type
Brief Announcement: Linearizability: A Typo	2024-03-26	Paper
The ERA Theorem for Safe Memory Reclamation	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6083405	2023-12-08	Paper
Passing Messages while Sharing Memory	2019-09-19	Paper
CBPQ: high performance lock-free priority queue	2018-01-11	Paper
Computational complexity and knowledge complexity (extended abstract)	2016-09-01	Paper
Automated verification of practical garbage collectors	2015-07-03	Paper
The hardness of cache conscious data placement	2015-03-17	Paper
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds	2015-02-27	Paper
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds	2015-02-27	Paper
Black-box constructions for secure computation	2014-11-25	Paper
Space overhead bounds for dynamic memory management with partial compaction	2014-04-10	Paper
Black-Box Constructions of Protocols for Secure Computation	2011-07-29	Paper
On Achieving the “Best of Both Worlds” in Secure Multiparty Computation	2011-05-17	Paper
Automated verification of practical garbage collectors	2010-09-21	Paper
Advances in Cryptology - CRYPTO 2003	2007-11-28	Paper
Advances in Cryptology - CRYPTO 2003	2007-11-28	Paper
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation	2007-09-04	Paper
Lower and upper bounds on obtaining history independence	2006-04-28	Paper
The hardness of cache conscious data placement	2006-02-06	Paper
Lower bounds for concurrent zero knowledge	2006-01-26	Paper
Linear hash functions	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4474189	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4434873	2003-11-26	Paper
An efficient noninteractive zero-knowledge proof system for NP with general assumptions	2003-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4417794	2003-07-30	Paper
Uniform generation of NP-witnesses using an NP-oracle	2003-01-14	Paper
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds	2003-01-05	Paper
On the knowledge complexity of \(\mathcal N\mathcal P\)	2002-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4527014	2001-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4527017	2001-02-28	Paper
CBC MAC for real-time data sources	2000-08-08	Paper
Quantifying knowledge complexity	1999-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q4249328	1999-06-17	Paper
Computational Complexity and Knowledge Complexity	1998-09-20	Paper
Is code equivalence easy to decide?	1998-04-13	Paper
The hardness of approximation: Gap location	1994-09-01	Paper
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols	1990-01-01	Paper

Research outcomes over time

This page was built for person: Erez Petrank