Access the full text.
Sign up today, get DeepDyve free for 14 days.
Lescuyer (2013)
Canard Anonymous credentials from indexed aggregate signatures Proceedings of the Workshop on Digital Identity ManagementChicago IL USA October, 21
Groth (2008)
Efficient non - interactive proof systems for bilinear groups In editor volume ofLNCS pages Istanbul Turkey Heidelberg
Camenisch (2014)
Formal treatment of privacy - enhancing credential systems Cryptology ePrint Archive Report http eprint iacr org, 15
Backes (2016)
and Schröder functional signatures In and editors Part volume ofLNCS pages Taiwan, 6
Belenkiy (2008)
and signatures and noninteractive anonymous credentials In editor volume ofLNCS pages San CA USA Heidelberg
Hanser (2014)
Structure - preserving signatures on equivalence classes and their application to anonymous credentials In editors Part volume ofLNCS pages HeidelbergTaiwan
Camenisch
and modular anonymous credentials Definitions practical constructions In editors ASIACRYPT Part II volume ofLNCS pages Auckland New Zealand Nov Heidelberg, 12
Okamoto (2011)
Achieving short ciphertexts or short secret - keys for adaptively secure general inner - product encryption In editors CANS volume ofLNCS pages China Heidelberg, 11
Waters (2011)
policy attribute based encryption An expressive efficient and provably secure realization In and editors volume ofLNCS pages Italy Mar
Maffei
Schröder Privacy and access control for outsourced personal records In on Privacy pages San CaliforniaIEEE Symposium Security USA IEEE Computer Society
Bethencourt (2007)
policy attribute based encryption In on Privacy pages Oakland CaliforniaIEEE Symposium Security USA IEEE Computer Society
Camenisch
Un linkable pseudonyms for governmental databases In editors pages Denver CO USA, 16
Micali (1988)
Goldwasser digital signature scheme secure against adaptive chosen - message attacks onSIAM Journal Computing, 31
Kolesnikov (2016)
Attribute - based key exchange with general policies pages, 16
Lynn (2010)
The pairing based cryptography pbclibrary
Lescuyer (2013)
Canard Protecting privacy by sanitizing personal data : a new approach to anonymous credentials In - editors pages China, 22
Belenkiy (2009)
and proofs and delegatable anonymous credentials In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
Parno (2012)
and How to delegate and verify in public : Verifiable computation from attribute - based encryption In editor volume ofLNCS pages
Chaum (1982)
Blind signatures for untraceable payments In and editors pages Santa CA Plenum NewUSA USA, 25
Katz (2008)
and Predicate encryption supporting disjunctions polynomial equations and inner products In editor volume ofLNCS pages Istanbul Turkey Heidelberg
Camenisch (2004)
Signature schemes and anonymous credentials from bilinear maps In editor volume ofLNCS pages Santa CA USA Aug Heidelberg, 19
Schnorr (1991)
Efficient signature generation by smart cards ofJournal Cryptology, 4
Camenisch (2001)
An efficient system for non - transferable anonymous credentials with optional anonymity revocation In editor volume ofLNCS pages Innsbruck Austria Heidelberg, 17
Gentry (2009)
Fully homomorphic encryption using ideal lattices In editor st pages Bethesda MarylandUSA, 30
Camenisch (2011)
Oblivious transfer with hidden access control policies In editors volume ofLNCS pages, 13
Chaum (1981)
by anonymous monitors In editor volume Report pages Santa CA Santa ofVerification USA Computer Eng, 24
Camenisch (2012)
Oblivious transfer with hidden access control from attribute - based encryption In editors volume ofLNCS pages Amalfi Italy Sept Heidelberg, 11
Au (2012)
free blacklistable anonymous credentials with reputation San Feb The InternetCalifornia USA Society
Acar (2011)
Revocation for delegatable anonymous credentials In editors volume ofLNCS pages
Canetti (2001)
Universally composable commitments In editor volume ofLNCS pages Santa CA USA Aug Heidelberg, 23
Frikken (2006)
Trust negotiation with hidden credentials hidden policies and policy cycles San Diego California USA Feb The InternetSociety, 28
Bellare (1993)
Random oracles are practical paradigm for designing efficient protocols In editor pages Virginia NovUSA
Damgård (2002)
Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor In editor volume ofLNCS pages Santa CA USA Aug Heidelberg, 27
Fuchsbauer (2014)
Slamanig Structurepreserving signatures on equivalence classes and constantsize anonymous credentials Cryptology ePrint Archive Report http eprint iacr org, 29
Yamada (2012)
Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication In editors volume ofLNCS pages Darmstadt
Dagum (1998)
An industry - standard api for shared - memory programming JanIEEE Comput Sci Eng, 26
Okamoto (2009)
Hierarchical predicate encryption for inner - products In editor volume ofLNCS pages Japan Heidelberg, 6
AbstractA functional credential allows a user to anonymously prove possession of a set of attributes that fulfills a certain policy. The policies are arbitrary polynomially computable predicates that are evaluated over arbitrary attributes. The key feature of this primitive is the delegation of verification to third parties, called designated verifiers. The delegation protects the privacy of the policy: A designated verifier can verify that a user satisfies a certain policy without learning anything about the policy itself. We illustrate the usefulness of this property in different applications, including outsourced databases with access control. We present a new framework to construct functional credentials that does not require (non-interactive) zero-knowledge proofs. This is important in settings where the statements are complex and thus the resulting zero-knowledge proofs are not efficient. Our construction is based on any predicate encryption scheme and the security relies on standard assumptions. A complexity analysis and an experimental evaluation confirm the practicality of our approach.
Proceedings on Privacy Enhancing Technologies – de Gruyter
Published: Apr 1, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.