Non Observability in the Random Oracle Model

DOI10.1007/978-3-642-41227-1_5zbMath1319.94049OpenAlexW213085963MaRDI QIDQ2856158

Raghav Bhaskar, Prabhanjan V. Ananth

Publication date: 23 October 2013

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41227-1_5

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

The wonderful world of global random oracles ⋮ A light-weight bit commitment protocol based on unpredictable channel noise ⋮ Non-adaptive programmability of random oracle

This page was built for publication: Non Observability in the Random Oracle Model