Checking the correctness of memories
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Introduction to Algorithms
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
Efficient Accumulators without Trapdoor Extended Abstracts
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Blind, Auditable Membership Proofs
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A General Model for Authenticated Data Structures
Algorithmica
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
How Efficient Can Memory Checking Be?
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Time and space efficient algorithms for two-party authenticated data structures
ICICS'07 Proceedings of the 9th international conference on Information and communications security
A new dynamic accumulator for batch updates
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Super-efficient verification of dynamic outsourced databases
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Verified query results from hybrid authentication trees
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
ACM SIGACT News
Integrity Protection for Revision Control
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Dynamic provable data possession
Proceedings of the 16th ACM conference on Computer and communications security
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
Integrity and consistency for untrusted services
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Optimal authenticated data structures with multilinear forms
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
Secure authenticated comparisons
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
ACM Transactions on Information and System Security (TISSEC)
Efficient verification of web-content searching through authenticated web crawlers
Proceedings of the VLDB Endowment
Efficient query integrity for outsourced dynamic databases
Proceedings of the 2012 ACM Workshop on Cloud computing security workshop
Authenticating operation-based history in collaborative systems
Proceedings of the 17th ACM international conference on Supporting group work
Signatures of correct computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Authenticated data structures, generically
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
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 that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ensuring the integrity of the stored data, is crucial because the server, lying outside the administrative control of the client, can be malicious. We design efficient and secure protocols for optimally authenticating membership queries on hash tables: for any fixed constants 0 1/ε, the server can provide a proof of integrity of the answer to a (non-)membership query in constant time, requiring O(nε/logκε--1 n) time to treat updates, yet keeping the communication and verification costs constant. This is the first construction for authenticating a hash table with constant query cost and sublinear update cost. Our solution employs the RSA accumulator in a nested way over the stored data, strictly improving upon previous accumulator-based solutions. Our construction applies to two concrete data authentication models and lends itself to a scheme that achieves different trade-offs---namely, constant update time and O(nε/logκε n) query time for fixed ε 0 and κ 0. An experimental evaluation of our solution shows very good scalability.