TY - GEN
T1 - Membership encryption and its applications
AU - Guo, Fuchun
AU - Mu, Yi
AU - Susilo, Willy
AU - Varadharajan, Vijay
PY - 2013
Y1 - 2013
N2 - We propose a new encryption primitive called Membership Encryption. Let P(G) be a privacy-preserving token on a group attribute/identity G, such that given P(G) it is hard to know the attributes in G. In this membership encryption, if an encryption takes as input an attribute A and the token P(G), the decryption requires holding the membership A ∈ G, i.e., A belongs to this group attribute. Membership encryption is applicable in constructing membership proof A ∈ P(G) with privacy preserving on group attribute and the membership. Membership encryption can be also utilized to construct an efficient two-round K-out-of-N oblivious transfer protocol. In this paper, we construct a provably secure membership encryption where the group token P(G) is constant-size with maximum number accountability on attributes. Using our scheme, the proposed oblivious transfer protocol exhibits the nice feature of O(1) communication cost for any K from receiver to sender, and O(N) communication cost from sender to receiver.
AB - We propose a new encryption primitive called Membership Encryption. Let P(G) be a privacy-preserving token on a group attribute/identity G, such that given P(G) it is hard to know the attributes in G. In this membership encryption, if an encryption takes as input an attribute A and the token P(G), the decryption requires holding the membership A ∈ G, i.e., A belongs to this group attribute. Membership encryption is applicable in constructing membership proof A ∈ P(G) with privacy preserving on group attribute and the membership. Membership encryption can be also utilized to construct an efficient two-round K-out-of-N oblivious transfer protocol. In this paper, we construct a provably secure membership encryption where the group token P(G) is constant-size with maximum number accountability on attributes. Using our scheme, the proposed oblivious transfer protocol exhibits the nice feature of O(1) communication cost for any K from receiver to sender, and O(N) communication cost from sender to receiver.
UR - http://www.scopus.com/inward/record.url?scp=84884497158&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-39059-3_15
DO - 10.1007/978-3-642-39059-3_15
M3 - Conference proceeding contribution
AN - SCOPUS:84884497158
SN - 9783642390586
VL - 7959
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 219
EP - 234
BT - Information Security and Privacy - 18th Australasian Conference, ACISP 2013, Proceedings
A2 - Boyd, Colin
A2 - Simpson, Leonie
PB - Springer, Springer Nature
CY - Heidelberg
T2 - 18th Australasian Conference on Information Security and Privacy, ACISP 2013
Y2 - 1 July 2013 through 3 July 2013
ER -