Filters








10,184 Hits in 3.8 sec

More Practical and Secure History-Independent Hash Tables [chapter]

Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016 Lecture Notes in Computer Science  
To our knowledge, our hash table construction is the first data structure that combines history-independence and protection against a form of timing attacks.  ...  • It is weakly history-independent. • It is secure against collision-timing attacks.  ...  National Science Foundation under grants CCF-1535795, CCF-1320231, CNS-1228485, CNS-1228598, and CNS-1228639, and by the Kanellakis Fellowship at Brown University.  ... 
doi:10.1007/978-3-319-45741-3_2 fatcat:jtf7jjehefdk5isknxs57cuslq

Practical Foundations of History Independence [article]

Sumeet Bajaj, Anrin Chakraborti, Radu Sion
2015 arXiv   pre-print
Finally, to bridge the gap between theory and practice, we outline a general recipe for building end-to-end, history independent systems and demonstrate the use of the recipe in designing two history independent  ...  There are two existing notions of history independence -- weak history independence (WHI) and strong history independence (SHI).  ...  This is an essential step towards formalizing history independence. • New game-based definitions of weak and strong history independence (Sections IV-A and IV-B) that are more appropriate for the security  ... 
arXiv:1501.06508v4 fatcat:txzs6uowzfbwbfuo6t5u7h47sa

HIFS

Sumeet Bajaj, Radu Sion
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
In this work we devise a way to achieve history independence while preserving locality (and thus be practical).  ...  HIFS guarantees secure deletion by providing full history independence across both file system and disk layers of the storage stack.  ...  History Independent Hash Table. [5] then uses the above property of the Stable Marriage algorithm to construct a history independent hash table as follows.  ... 
doi:10.1145/2508859.2516724 dblp:conf/ccs/BajajS13 fatcat:pxmqoh4qmffztn7eiky427ftei

Tamper-evident, history-independent, subliminal-free data structures on PROM storage -or- how to store ballots on a voting machine

D. Molnar, T. Kohno, N. Sastry, D. Wagner
2006 2006 IEEE Symposium on Security and Privacy (S&P'06)  
At the same time, the order in which votes are cast must be hidden to protect the privacy of voters, so the data structure should be history-independent.  ...  We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine.  ...  We also thank the anonymous reviewers of the IEEE Symposium on Security and Privacy and Philippe Golle. D. Molnar was supported in part by NSF CCR-0325311 and by a NSF Graduate Research Fellowship.  ... 
doi:10.1109/sp.2006.39 dblp:conf/sp/MolnarKSW06 fatcat:r25keiinlbf4vdm7qw5giqjtfq

Security vulnerabilities and solutions for packet sampling

Sharon Goldberg, Jennifer Rexford
2007 2007 IEEE Sarnoff Symposium  
with a cryptographic random number generator, and (3) secure coordinated sampling requires a cryptographic pseudorandom function, keyed with a secret key that should be changed each time the sampler leaks  ...  We show that (1) some of the packet sampling techniques suggested in current drafts of the PSAMP charter have security vulnerabilities, (2) secure uncoordinated sampling can be achieved using random sampling  ...  the attack on the hash function f a,b,k (d) = ad + b mod k.  ... 
doi:10.1109/sarnof.2007.4567339 fatcat:oe6s5n47azcaxeakmyp5w6yu3y

Auditable Data Structures

Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2017 2017 IEEE European Symposium on Security and Privacy (EuroS&P)  
We consider two audit scenarios-secure topology, where an auditor can observe the contents and pointers of a data structure, and secure implementation, where an auditor can observe the memory layout of  ...  The concept of weak history-independence (WHI) assumes only a single observation will ever occur, while strong history-independence (SHI) allows for multiple observations at arbitrary times.  ...  [16] present a WHI hash table with linear probing that is faster in practice than its SHI analogue. Bender et al.  ... 
doi:10.1109/eurosp.2017.46 dblp:conf/eurosp/GoodrichKMT17 fatcat:nqhtw3klb5gklksbn5wuyfpucy

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence

Daniel S. Roche, Adam Aviv, Seung Geol Choi
2016 2016 IEEE Symposium on Security and Privacy (SP)  
This represents a 100x speed-up compared to the current best oblivious map data structure (which provides neither secure deletion nor history independence) by Wang et al.  ...  maps: even upon client compromise, deleted data and the history of old operations remain hidden to the attacker.  ...  Acknowledgements The authors are supported by the Office of Naval Research (ONR), as well as National Science Foundation awards #1406192 and #1319994.  ... 
doi:10.1109/sp.2016.19 dblp:conf/sp/RocheAC16 fatcat:672ijplvyjgfhfkdyrcvwtoq6e

Hashing Techniques

Lianhua Chi, Xingquan Zhu
2017 ACM Computing Surveys  
Hashing techniques have also evolved from simple randomization approaches to advanced adaptive methods considering locality, structure, label information, and data security, for effective hashing.  ...  This survey reviews and categorizes existing hashing techniques as a taxonomy, in order to provide a comprehensive view of mainstream hashing techniques for different types of data and applications.  ...  For applications without strong security concerns, a simpler hashing mechanism, called cryptographically insecure hashing or noncryptographic hashing, is more practical.  ... 
doi:10.1145/3047307 fatcat:u5asusjs7vdq7f3a6wgnesnodq

A Critical Look at Cryptographic Hash Function Literature

Scott Contini, Ron Steinfeld, Josef Pieprzyk, Krystian Matusiewicz
2008 Coding and Cryptology  
The cryptographic hash function literature has numerous hash function definitions and hash function requirements, and many of them disagree.  ...  This survey talks about the various definitions, and takes steps towards cleaning up the literature by explaining how the field has evolved and accurately depicting the research aims people have today.  ...  ·, ·) is CR Family [36], 2 Remarks on table entries: (a) The security requirement stated here are for the "2-key" variant of HMAC which uses two independent keys [2] .  ... 
doi:10.1142/9789812832245_0005 fatcat:7fcvikoes5bdtlhktp524idmuu

Some Open Questions Related to Cuckoo Hashing [chapter]

Michael Mitzenmacher
2009 Lecture Notes in Computer Science  
Hash tables and related structures, such as Bloom filters and their derivatives, are used billions of times a day, and new uses keep proliferating.  ...  Introduction Hash-based data structures and algorithms are currently a booming industry in the Internet, particularly for applications related to measurement, monitoring, and security.  ...  Acknowledgments I thank Martin Dietzfelbinger and Rasmus Pagh for helpful discussions, assistance with references, and comments on an earlier draft of this work.  ... 
doi:10.1007/978-3-642-04128-0_1 fatcat:racmrnhzsbfa3hn2m7ckevqdcu

Strongly History-Independent Hashing with Applications

Guy E. Blelloch, Daniel Golovin
2007 Foundations of Computer Science (FOCS), IEEE Annual Symposium on  
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space.  ...  This matches the bounds for dynamic perfect hashing, and improves on the best previous results by Naor and Teague on history independent hashing, which were either weakly history independent, or only supported  ...  Acknowledgments We thank Kirk Pruhs, Shan Leung Maverick Woo, and Adam Wierman for helpful discussions.  ... 
doi:10.1109/focs.2007.4389499 fatcat:vf5efgaofraibci66qmq2lhrs4

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence [article]

Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
2015 arXiv   pre-print
This represents a 100x speed-up compared to the current best oblivious map data structure (which provides neither secure deletion nor history independence) by Wang et al. (CCS 14).  ...  We also present a new history-independent data structure (a HIRB tree) that can be stored within a vORAM.  ...  Acknowledgements The authors are supported by the Office of Naval Research (ONR), as well as National Science Foundation awards #1406192 and #1319994.  ... 
arXiv:1505.07391v2 fatcat:sd4x6fofsndh5f3oxjj6mbjnd4

Strongly History-Independent Hashing with Applications

Guy E. Blelloch, Daniel Golovin
2007 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)  
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space.  ...  This matches the bounds for dynamic perfect hashing, and improves on the best previous results by Naor and Teague on history independent hashing, which were either weakly history independent, or only supported  ...  Acknowledgments We thank Kirk Pruhs, Shan Leung Maverick Woo, and Adam Wierman for helpful discussions.  ... 
doi:10.1109/focs.2007.36 dblp:conf/focs/BlellochG07 fatcat:y2x7gzi7nre5doxjqhpk7sq5ba

Tamper Detection in Audit Logs [chapter]

R SNODGRASS, S YAO, C COLLBERG
2004 Proceedings 2004 VLDB Conference  
Audit logs are considered good practice for business systems, and are required by federal regulations for secure systems, drug approval data, medical information disclosure, financial records, and electronic  ...  This paper proposes mechanisms within a database management system (DBMS), based on cryptographically strong one-way hash functions, that prevent an intruder, including an auditor or an employee or even  ...  in the notarization history table.  ... 
doi:10.1016/b978-012088469-8/50046-2 fatcat:ypkzylyy6zdkxcjomc3odezpeq

Tamper Detection in Audit Logs [chapter]

Richard T. Snodgrass, Shilong Stanley Yao, Christian Collberg
2004 Proceedings 2004 VLDB Conference  
Audit logs are considered good practice for business systems, and are required by federal regulations for secure systems, drug approval data, medical information disclosure, financial records, and electronic  ...  This paper proposes mechanisms within a database management system (DBMS), based on cryptographically strong one-way hash functions, that prevent an intruder, including an auditor or an employee or even  ...  in the notarization history table.  ... 
doi:10.1016/b978-012088469-8.50046-2 dblp:conf/vldb/SnodgrassYC04 fatcat:rd7yuhbq2bb5xnqpslwh3rigsq
« Previous Showing results 1 — 15 out of 10,184 results