File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems

TitleDynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems
Authors
Issue Date2009
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, v. 5473, p. 295-308 How to Cite?
AbstractWe present the first dynamic universal accumulator that allows (1) the accumulation of elements in a DDH-hard group G and (2) one who knows x such that y = gx has - or has not - been accumulated, where g generates G, to efficiently prove her knowledge of such x in zero knowledge, and hence without revealing, e.g., x or y. We introduce the Attribute-Based Anonymous Credential System, which allows the verifier to authenticate anonymous users according to any access control policy expressible as a formula of possibly negated boolean user attributes. We construct the system from our accumulator.
Persistent Identifierhttp://hdl.handle.net/10722/280754
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorAu, Man Ho-
dc.contributor.authorTsang, Patrick P.-
dc.contributor.authorSusilo, Willy-
dc.contributor.authorMu, Yi-
dc.date.accessioned2020-02-17T14:34:51Z-
dc.date.available2020-02-17T14:34:51Z-
dc.date.issued2009-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, v. 5473, p. 295-308-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/280754-
dc.description.abstractWe present the first dynamic universal accumulator that allows (1) the accumulation of elements in a DDH-hard group G and (2) one who knows x such that y = gx has - or has not - been accumulated, where g generates G, to efficiently prove her knowledge of such x in zero knowledge, and hence without revealing, e.g., x or y. We introduce the Attribute-Based Anonymous Credential System, which allows the verifier to authenticate anonymous users according to any access control policy expressible as a formula of possibly negated boolean user attributes. We construct the system from our accumulator.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.titleDynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-00862-7_20-
dc.identifier.scopuseid_2-s2.0-67650132596-
dc.identifier.volume5473-
dc.identifier.spage295-
dc.identifier.epage308-
dc.identifier.eissn1611-3349-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats