We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
This paper attempts to address the issue of hardening the internal security of an organisation's network by easing its patch management. Traditionally security has been model...
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
N. Asokan, Philippe A. Janson, Michael Steiner, Mi...
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...