TY - GEN
T1 - Oblivious transfer with access control: Realizing disjunction without duplication
AU - Zhang, Ye
AU - Au, Man Ho Allen
AU - Wong, Duncan S.
AU - Huang, Qiong
AU - Mamoulis, Nikos
AU - Cheung, David W.
AU - Yiu, Siu Ming
PY - 2010/12/23
Y1 - 2010/12/23
N2 - Oblivious Transfer with Access Control (AC-OT) is a protocol which allows a user to obtain a database record with a credential satisfying the access policy of the record while the database server learns nothing about the record or the credential. The only AC-OT construction that supports policy in disjunctive form requires duplication of records in the database, each with a different conjunction of attributes (representing one possible criterion for accessing the record). In this paper, we propose a new AC-OT construction secure in the standard model. It supports policy in disjunctive form directly, without the above duplication issue. Due to the duplication issue in the previous construction, the size of an encrypted record is in O(Πi=1tni) for a CNF policy (A1,1∨ ... ∨ A1,n1) ∧ ... ∧ (At,1∨...∨ At,nt) and in O((kn)) for a k-of-n threshold gate. In our construction, the encrypted record size can be reduced to O(Σi=1tni) for CNF form and O(n) for threshold case.
AB - Oblivious Transfer with Access Control (AC-OT) is a protocol which allows a user to obtain a database record with a credential satisfying the access policy of the record while the database server learns nothing about the record or the credential. The only AC-OT construction that supports policy in disjunctive form requires duplication of records in the database, each with a different conjunction of attributes (representing one possible criterion for accessing the record). In this paper, we propose a new AC-OT construction secure in the standard model. It supports policy in disjunctive form directly, without the above duplication issue. Due to the duplication issue in the previous construction, the size of an encrypted record is in O(Πi=1tni) for a CNF policy (A1,1∨ ... ∨ A1,n1) ∧ ... ∧ (At,1∨...∨ At,nt) and in O((kn)) for a k-of-n threshold gate. In our construction, the encrypted record size can be reduced to O(Σi=1tni) for CNF form and O(n) for threshold case.
UR - http://www.scopus.com/inward/record.url?scp=78650299015&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17455-1_7
DO - 10.1007/978-3-642-17455-1_7
M3 - Conference article published in proceeding or book
SN - 364217454X
SN - 9783642174544
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 96
EP - 115
BT - Pairing-Based Cryptography, Pairing 2010 - 4th International Conference, Proceedings
T2 - 4th International Conference on Pairing-Based Cryptography, Pairing 2010
Y2 - 13 December 2010 through 15 December 2010
ER -