merkletree   5

Privacy Preserving Audit Proofs
The increased dependence on computers for critical tasks demands sufficient and transparent methods to audit its execution. This is commonly solved using logging where the log must not only be resilient against tampering and rewrites in hindsight but also be able to answer queries concerning (non)-membership of events in the log while preserving privacy. Since the log cannot assume to be trusted the answers must be verifiable using a proof of correctness.

This thesis describes a protocol capable of producing verifiable privacy preserving membership proofs using Merkle trees. For non-membership, a method used to authenticate Bloom filters using Merkle trees is proposed and analyzed. Since Bloom filters are a probabilistic data structures, a method of handling false positives is also proposed.
exjobb  privacy  AntonLindqvist  KTH  Omegapoint  audit  logging  security  bloomfilter  merkletree 
september 2017 by moonhouse
Computing: Secure the Internet : Nature : Nature Publishing Group
RT @timohannay Ben Laurie and Cory Doctorow comment in Nature on closing important internet security flaw: #merkleTree
merkleTree  twitter 
november 2012 by anjackson

related tags

algorithms  antonlindqvist  article  audit  bitcoin  blog  bloomfilter  certificatetransparency  computerscience  contract  crypto  datastructure  digest  ds  exjobb  git  golang  hash  kth  labs  logging  merkle  nebulous  omegapoint  pki  post  privacy  qc  security  tree  twitter  versioning 

Copy this bookmark: