Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.68403DBLPconf/crypto/2003OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428135

Erez Petrank, Niv Buchbinder

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817

zbMATH Keywords

PrivacyLower boundsHistory independent data-structuresThe heap data-structureThe queue data-structure

Mathematics Subject Classification ID

Cryptography (94A60) Data structures (68P05)

Related Items (1)

Lower and upper bounds on obtaining history independence

This page was built for publication: Advances in Cryptology - CRYPTO 2003