Lower and upper bounds on obtaining history independence

DOI10.1016/J.IC.2005.11.001MaRDI QIDQ2490116zbMATH OpenOpenAlexFDO

Authors Niv Buchbinder, Erez Petrank

Publication date 28 April 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2005.11.001

zbMATH Keywords

History independent data-structuresLower boundsPrivacyThe heap data-structureThe queue data-structure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Advances in Cryptology - CRYPTO 2003
• scientific article; zbMATH DE number 1979502
• Characterizing history independent data structures
• Anti-persistence
• History-Independent Cuckoo Hashing

Cites work

• A note on two problems in connexion with graphs
• Advances in Cryptology - CRYPTO 2003
• Anti-persistence
• scientific article; zbMATH DE number 1263180 (Why is no real title available?)
• scientific article; zbMATH DE number 1979502 (Why is no real title available?)
• scientific article; zbMATH DE number 1559561 (Why is no real title available?)
• Making data structures persistent
• Software protection and simulation on oblivious RAMs

Cited in

(4)

• Characterizing history independent data structures
• Uniquely Represented Data Structures for Computational Geometry
• scientific article; zbMATH DE number 1979502 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: Lower and upper bounds on obtaining history independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490116)