Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems

Au, Man Ho; Tsang, Patrick P.; Susilo, Willy; Mu, Yi

doi:10.1007/978-3-642-00862-7_20

Cited by 74 publications

(68 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of such a primitive gives an authenticated dictionary with constant communication and constant verification complexity, while maintaining all other complexities logarithmic. To the best of our knowledge, this is the first optimal authenticated dictionary to appear in the literature, as it exactly matches the respective complexities 3 (update time, query time, answer size) of the optimal dictionary data structure (e.g., implemented as a red-black tree).…”

Section: Introductionmentioning

confidence: 90%

“…An authenticated data structure that combines hierarchical hashing with the accumulation-based scheme of [21] is presented in [22] and accumulators using other cryptographic primitives (e.g., general groups with bilinear pairings) the security of which is based on other assumptions (e.g., hardness of strong Diffie-Hellman problem) are introduced in [11,32,42]. Non-membership proofs for accumulators are presented in [3,16,26]. Finally, authenticated hash tables that use the RSA accumulator are introduced in [35].…”

Section: Related Workmentioning

confidence: 99%

“…Alternatively (and less efficiently), one can explicitly compute non-membership witnesses, as described in [3,16]. In the following we present the computational assumption on which the security of the bilinear-map accumulator is based, the q-strong Diffie-Hellman assumption.…”

Section: The Bilinear-map Accumulatormentioning

confidence: 99%

See 2 more Smart Citations

Optimal Authenticated Data Structures with Multilinear Forms

Papamanthou

Tamassia

Triandopoulos

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. 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.

show abstract

Section: Introductionmentioning

confidence: 90%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Authenticated Data Structures with Multilinear Forms

Papamanthou

Tamassia

Triandopoulos

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In CRYPTO 2002, Camenisch and Lysyanskaya [9] introduced dynamic accumulators, that enable updating the accumulation value when inputs are dynamically added or deleted, such that the cost of an update is independent of the number of accumulated inputs. However, all dynamic accumulator constructions that appeared since then (e.g., [3,8,9,26,32]) share one common limitation: Computing a witness, in absence of the trapdoor information (which has many practical applications, e.g., [36]), takes at least linear time. We observe that our construction comprises a dynamic accumulator that does not have this limitation: Specifically, for a set of elements X ⊆ {0, 1, .…”

Section: Applicationsmentioning

confidence: 99%

“…We thus achieve an exponential improvement for many common queries in the prover's running time. 3. Expressiveness.…”

Section: Introductionmentioning

confidence: 99%

Streaming Authenticated Data Structures

Papamanthou

Shi

Tamassia

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We consider the problem of streaming verifiable computation, where both a verifier and a prover observe a stream of n elements x1, x2, . . . , xn and the verifier can later delegate some computation over the stream to the prover. The prover must return the output of the computation, along with a cryptographic proof to be used for verifying the correctness of the output. Due to the nature of the streaming setting, the verifier can only keep small local state (e.g., logarithmic) which must be updatable in a streaming manner and with no interaction with the prover. Such constraints make the problem particularly challenging and rule out applying existing verifiable computation schemes.We propose streaming authenticated data structures, a model that enables efficient verification of data structure queries on a stream. Compared to previous work, we achieve an exponential improvement in the prover's running time: While previous solutions have linear prover complexity (in the size of the stream), even for queries executing in sublinear time (e.g., set membership), we propose a scheme with O(log M log n) prover complexity, where n is the size of the stream and M is the size of the universe of elements. Our schemes support a series of expressive queries, such as (non-)membership, successor, range search and frequency queries, over an ordered universe and even in higher dimensions. The central idea of our construction is a new authentication tree, called generalized hash tree. We instantiate our generalized hash tree with a hash function based on lattices assumptions, showing that it enjoys suitable algebraic properties that traditional Merkle trees lack. We exploit such properties to achieve our results.

show abstract

Secure cloud storage using anonymous and blackbox traceable data access control

Zhang

2015

Security Comm Networks

View full text Add to dashboard Cite

In cloud storage systems, data outsourcing and untrusted service providers make data‐access control become a challenging issue because traditional technologies always consider service providers as a fully trusted party. Ciphertext‐policy attribute‐based encryption (CP‐ABE) shows particular advantages in this setting because this encryption gives the data owner a direct control on data‐access policies. However, malicious users in traditional CP‐ABE systems may leak their decryption keys in the form of a decryption device/blackbox with little risk of getting caught because no one (including the key authorities) can reveal them. This issue has become a major practicality concern in many data outsourcing applications (e.g., financial and healthcare systems) where the preservation of privacy with regard to sensitive data is critical. To address this problem, blackbox traceable CP‐ABE leveraged the “traitor tracing” property of broadcast encryption to identify these malicious users. However, the size of the keys and ciphertexts in the blackbox traceable CP‐ABE depends on the number of users. In this paper, we introduce an accumulator‐based encryption (ACC‐ENC), which can be integrated with conventional non‐traceable CP‐ABE‐based data‐access control to achieve an additional blackbox traceability feature without sacrificing performance (just adds scriptO(1) elements to the ciphertext and the public key). We first formally define the model of ACC‐ENC and present a concrete construction that is proven fully secure; then, we illustrate applying ACC‐ENC to obtain CP‐ABE‐based data‐access control with blackbox traceability for cloud storage. Performance evaluation shows that additional computation costs of the proposition are very low compared to the original scheme. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems

Cited by 74 publications

References 22 publications

Optimal Authenticated Data Structures with Multilinear Forms

Optimal Authenticated Data Structures with Multilinear Forms

Streaming Authenticated Data Structures

Secure cloud storage using anonymous and blackbox traceable data access control

Contact Info

Product

Resources

About