Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials

  • Authors:
  • Stanisław Jarecki;Xiaomin Liu

  • Affiliations:
  • University of California, Irvine,;University of California, Irvine,

  • Venue:
  • ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an efficient implementation of affiliation-hiding envelope and authentication schemes. An envelope scheme enables secure message transmission between two parties s.t. the message can be decrypted only by a receiver who holds a credential from (i.e. is affiliated with) an entity specified by the sender's authorization policy. An envelope scheme is affiliation-hiding if it hides the receiver's affiliation, and if the sender's policy is revealed only to receivers who satisfy it. Similarly, an authentication scheme is affiliation-hiding if it reveals information about affiliations and the authentication policy of a participating party only to counterparties that satisfy this policy.The novelty of our affiliation-hiding envelope scheme is that it remains practical in the multi-affiliation settingwithout relying on groups with bilinear maps. Namely, it requires O(n) modular exponentiations and communicates O(n) group elements, even if each party has ncredentials, and each party's authentication policy specifies nadmissible affiliations. Moreover, our affiliation-hiding envelope is chosen-ciphertext secure, which leads to a provably secure affiliation-hiding authentication scheme with same O(n) efficiency in the multi-affiliation setting.