Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of 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
Introduction to Algorithms
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
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
A General Model for Authenticated Data Structures
Algorithmica
A One Round Protocol for Tripartite Diffie–Hellman
Journal of Cryptology
Flexible authentication of XML documents
Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
Universal Accumulators with Efficient Nonmembership Proofs
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Efficient Content Authentication in Peer-to-Peer Networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Efficient Distributed Third-Party Data Authentication for Tree Hierarchies
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Proceedings of the 15th ACM conference on Computer and communications security
The complexity of online memory checking
Journal of the ACM (JACM)
How Efficient Can Memory Checking Be?
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
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
A secure signature scheme from bilinear maps
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
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
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances 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
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
ID-based multi-party authenticated key agreement protocols from multilinear forms
ISC'05 Proceedings of the 8th international conference on Information Security
Optimal verification of operations on dynamic sets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Generalised jacobians in cryptography and coding theory
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
| Hi-index | 0.00 |
Cloud computing and cloud storage are becoming increasingly prevalent. In this paradigm, clients outsource their data and computations to third-party service providers. Data integrity in the cloud therefore becomes an important factor for the functionality of these web services. Authenticated data structures, implemented with various cryptographic primitives, have been widely studied as a means of providing efficient solutions to data integrity problems (e.g., Merkle trees). In this paper, we introduce a new authenticated dictionary data structure that employs multilinear forms, a cryptographic primitive proposed by Silverberg and Boneh in 2003 [10], the construction of which, however, remains an open problem to date. Our authenticated dictionary is optimal, that is, it does not add any extra asymptotic cost to the plain dictionary data structure, yielding proofs of constant size, i.e., asymptotically equal to the size of the answer, while maintaining other relevant complexities logarithmic. Instead, solutions based on cryptographic hashing (e.g., Merkle trees) require proofs of logarithmic size [40]. Because multilinear forms are not known to exist yet, our result can be viewed from a different angle: if one could prove that optimal authenticated dictionaries cannot exist in the computational model, irrespectively of cryptographic primitives, then our solution would imply that cryptographically interesting multilinear form generators cannot exist as well (i.e., it can be viewed as a reduction). Thus, we provide an alternative avenue towards proving the nonexistence of multilinear form generators in the context of general lower bounds for authenticated data structures [40] and for memory checking [18], a model similar to the authenticated data structures model.