Erez Petrank

From MaRDI portal
Person:812825

Available identifiers

zbMath Open petrank.erezDBLP29/3287WikidataQ5385748 ScholiaQ5385748MaRDI QIDQ812825

List of research outcomes





PublicationDate of PublicationType
Brief Announcement: Linearizability: A Typo2024-03-26Paper
The ERA Theorem for Safe Memory Reclamation2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q60834052023-12-08Paper
Passing Messages while Sharing Memory2019-09-19Paper
CBPQ: high performance lock-free priority queue2018-01-11Paper
Computational complexity and knowledge complexity (extended abstract)2016-09-01Paper
Automated verification of practical garbage collectors2015-07-03Paper
The hardness of cache conscious data placement2015-03-17Paper
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds2015-02-27Paper
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds2015-02-27Paper
Black-box constructions for secure computation2014-11-25Paper
Space overhead bounds for dynamic memory management with partial compaction2014-04-10Paper
Black-Box Constructions of Protocols for Secure Computation2011-07-29Paper
On Achieving the “Best of Both Worlds” in Secure Multiparty Computation2011-05-17Paper
Automated verification of practical garbage collectors2010-09-21Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation2007-09-04Paper
Lower and upper bounds on obtaining history independence2006-04-28Paper
The hardness of cache conscious data placement2006-02-06Paper
Lower bounds for concurrent zero knowledge2006-01-26Paper
Linear hash functions2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q44741892004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44348732003-11-26Paper
An efficient noninteractive zero-knowledge proof system for NP with general assumptions2003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44177942003-07-30Paper
Uniform generation of NP-witnesses using an NP-oracle2003-01-14Paper
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds2003-01-05Paper
On the knowledge complexity of \(\mathcal N\mathcal P\)2002-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45270142001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45270172001-02-28Paper
CBC MAC for real-time data sources2000-08-08Paper
Quantifying knowledge complexity1999-09-01Paper
https://portal.mardi4nfdi.de/entity/Q42493281999-06-17Paper
Computational Complexity and Knowledge Complexity1998-09-20Paper
Is code equivalence easy to decide?1998-04-13Paper
The hardness of approximation: Gap location1994-09-01Paper
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols1990-01-01Paper

Research outcomes over time

This page was built for person: Erez Petrank