Uniquely Represented Data Structures with Applications to Privacy

Uniquely Represented Data Structures with Applications to Privacy

196 pages· 2008· ISBN 9780549957560
About
In this dissertation, we will answer this question for several important abstract data types, and argue that the overhead for unique representation is sufficiently low to warrant its widespread use in high security and high privacy environments. Towards this end, we provide the theoretical foundation for the development of efficient uniquely represented systems that provably store exactly the information their designs specify, and nothing more.

Discuss Uniquely Represented Data Structures with Applications to Privacy with other readers

Join or start a book club for Uniquely Represented Data Structures with Applications to Privacy on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Uniquely Represented Data Structures with Applications to Privacy?

Sign up free on Readfeed, then browse public clubs or start your own club with Uniquely Represented Data Structures with Applications to Privacy as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Uniquely Represented Data Structures with Applications to Privacy with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Uniquely Represented Data Structures with Applications to Privacy with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.