Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Functional Credentials

Functional Credentials 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Functional Credentials

Download PDF
21 pages

Loading next page...
 
/lp/de-gruyter/functional-credentials-gkPwFsQbgL
Publisher
de Gruyter
Copyright
© 2018 Dominic Deuber et al., published by De Gruyter Open
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2018-0013
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Apr 1, 2018

References

  • Attribute - based key exchange with general policies pages
    Kolesnikov
  • free blacklistable anonymous credentials with reputation San Feb The Internet
    Au
  • An efficient system for non - transferable anonymous credentials with optional anonymity revocation In editor volume ofLNCS pages Innsbruck Austria Heidelberg
    Camenisch
  • Blind signatures for untraceable payments In and editors pages Santa CA Plenum New
    Chaum
  • Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication In editors volume ofLNCS pages Darmstadt
    Yamada
  • Canard Protecting privacy by sanitizing personal data : a new approach to anonymous credentials In - editors pages China
    Lescuyer
  • Random oracles are practical paradigm for designing efficient protocols In editor pages Virginia Nov
    Bellare
  • policy attribute based encryption In on Privacy pages Oakland California
    Bethencourt
  • and Predicate encryption supporting disjunctions polynomial equations and inner products In editor volume ofLNCS pages Istanbul Turkey Heidelberg
    Katz
  • Un linkable pseudonyms for governmental databases In editors pages Denver CO USA
    Camenisch
  • Oblivious transfer with hidden access control policies In editors volume ofLNCS pages
    Camenisch
  • Attribute - based key exchange with general policies pages
    Kolesnikov
  • Goldwasser digital signature scheme secure against adaptive chosen - message attacks on
    Micali
  • policy attribute based encryption An expressive efficient and provably secure realization In and editors volume ofLNCS pages Italy Mar
    Waters
  • Un linkable pseudonyms for governmental databases In editors pages Denver CO USA
    Camenisch
  • Canard Protecting privacy by sanitizing personal data : a new approach to anonymous credentials In - editors pages China
    Lescuyer
  • Structure - preserving signatures on equivalence classes and their application to anonymous credentials In editors Part volume ofLNCS pages Heidelberg
    Hanser
  • Schröder Privacy and access control for outsourced personal records In on Privacy pages San California
    Maffei
  • Signature schemes and anonymous credentials from bilinear maps In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Camenisch
  • and modular anonymous credentials Definitions practical constructions In editors ASIACRYPT Part II volume ofLNCS pages Auckland New Zealand Nov Heidelberg
    Camenisch
  • and signatures and noninteractive anonymous credentials In editor volume ofLNCS pages San CA USA Heidelberg
    Belenkiy
  • Formal treatment of privacy - enhancing credential systems Cryptology ePrint Archive Report http eprint iacr org
    Camenisch
  • Efficient signature generation by smart cards of
    Schnorr
  • An industry - standard api for shared - memory programming Jan
    Dagum
  • Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Damgård
  • and modular anonymous credentials Definitions practical constructions In editors ASIACRYPT Part II volume ofLNCS pages Auckland New Zealand Nov Heidelberg
    Camenisch
  • Fully homomorphic encryption using ideal lattices In editor st pages Bethesda Maryland
    Gentry
  • Efficient non - interactive proof systems for bilinear groups In editor volume ofLNCS pages Istanbul Turkey Heidelberg
    Groth
  • Universally composable commitments In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Canetti
  • and signatures and noninteractive anonymous credentials In editor volume ofLNCS pages San CA USA Heidelberg
    Belenkiy
  • policy attribute based encryption An expressive efficient and provably secure realization In and editors volume ofLNCS pages Italy Mar
    Waters
  • Achieving short ciphertexts or short secret - keys for adaptively secure general inner - product encryption In editors CANS volume ofLNCS pages China Heidelberg
    Okamoto
  • and Predicate encryption supporting disjunctions polynomial equations and inner products In editor volume ofLNCS pages Istanbul Turkey Heidelberg
    Katz
  • Hierarchical predicate encryption for inner - products In editor volume ofLNCS pages Japan Heidelberg
    Okamoto
  • and proofs and delegatable anonymous credentials In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Belenkiy
  • Revocation for delegatable anonymous credentials In editors volume ofLNCS pages
    Acar
  • Trust negotiation with hidden credentials hidden policies and policy cycles San Diego California USA Feb The Internet
    Frikken
  • Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication In editors volume ofLNCS pages Darmstadt
    Yamada
  • Schröder Privacy and access control for outsourced personal records In on Privacy pages San California
    Maffei
  • free blacklistable anonymous credentials with reputation San Feb The Internet
    Au
  • and Schröder functional signatures In and editors Part volume ofLNCS pages Taiwan
    Backes
  • The pairing based cryptography pbc
    Lynn
  • An efficient system for non - transferable anonymous credentials with optional anonymity revocation In editor volume ofLNCS pages Innsbruck Austria Heidelberg
    Camenisch
  • Goldwasser digital signature scheme secure against adaptive chosen - message attacks on
    Micali
  • Hierarchical predicate encryption for inner - products In editor volume ofLNCS pages Japan Heidelberg
    Okamoto
  • and Schröder functional signatures In and editors Part volume ofLNCS pages Taiwan
    Backes
  • Formal treatment of privacy - enhancing credential systems Cryptology ePrint Archive Report http eprint iacr org
    Camenisch
  • Slamanig Structurepreserving signatures on equivalence classes and constantsize anonymous credentials Cryptology ePrint Archive Report http eprint iacr org
    Fuchsbauer
  • and proofs and delegatable anonymous credentials In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Belenkiy
  • Canard Anonymous credentials from indexed aggregate signatures Proceedings of the Workshop on Digital Identity Management
    Lescuyer
  • by anonymous monitors In editor volume Report pages Santa CA Santa of
    Chaum
  • and How to delegate and verify in public : Verifiable computation from attribute - based encryption In editor volume ofLNCS pages
    Parno
  • and How to delegate and verify in public : Verifiable computation from attribute - based encryption In editor volume ofLNCS pages
    Parno
  • policy attribute based encryption In on Privacy pages Oakland California
    Bethencourt
  • Efficient non - interactive proof systems for bilinear groups In editor volume ofLNCS pages Istanbul Turkey Heidelberg
    Groth
  • An industry - standard api for shared - memory programming Jan
    Dagum
  • Signature schemes and anonymous credentials from bilinear maps In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Camenisch
  • Oblivious transfer with hidden access control from attribute - based encryption In editors volume ofLNCS pages Amalfi Italy Sept Heidelberg
    Camenisch
  • Canard Anonymous credentials from indexed aggregate signatures Proceedings of the Workshop on Digital Identity Management
    Lescuyer
  • Universally composable commitments In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Canetti
  • Oblivious transfer with hidden access control policies In editors volume ofLNCS pages
    Camenisch
  • Trust negotiation with hidden credentials hidden policies and policy cycles San Diego California USA Feb The Internet
    Frikken
  • Fully homomorphic encryption using ideal lattices In editor st pages Bethesda Maryland
    Gentry
  • Revocation for delegatable anonymous credentials In editors volume ofLNCS pages
    Acar
  • Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor In editor volume ofLNCS pages Santa CA USA Aug Heidelberg
    Damgård
  • Slamanig Structurepreserving signatures on equivalence classes and constantsize anonymous credentials Cryptology ePrint Archive Report http eprint iacr org
    Fuchsbauer
  • by anonymous monitors In editor volume Report pages Santa CA Santa of
    Chaum
  • Blind signatures for untraceable payments In and editors pages Santa CA Plenum New
    Chaum
  • Structure - preserving signatures on equivalence classes and their application to anonymous credentials In editors Part volume ofLNCS pages Heidelberg
    Hanser
  • Achieving short ciphertexts or short secret - keys for adaptively secure general inner - product encryption In editors CANS volume ofLNCS pages China Heidelberg
    Okamoto
  • Efficient signature generation by smart cards of
    Schnorr
  • Oblivious transfer with hidden access control from attribute - based encryption In editors volume ofLNCS pages Amalfi Italy Sept Heidelberg
    Camenisch
  • Random oracles are practical paradigm for designing efficient protocols In editor pages Virginia Nov
    Bellare
  • The pairing based cryptography pbc
    Lynn