Concurrent zero-knowledge with timing, revisited

DOI10.1145/509907.509959zbMath1192.68293OpenAlexW2080860101MaRDI QIDQ3579206

Oded Goldreich

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509959

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)

Related Items (6)

A note on the Dwork-Naor timed deniable authentication ⋮ Public-coin parallel zero-knowledge for NP ⋮ Random walks and concurrent zero-knowledge ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model

This page was built for publication: Concurrent zero-knowledge with timing, revisited