File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-17455-1_7
- Scopus: eid_2-s2.0-78650299015
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Oblivious transfer with access control: Realizing disjunction without duplication
Title | Oblivious transfer with access control: Realizing disjunction without duplication |
---|---|
Authors | |
Keywords | Access policies Data-base servers Database records Oblivious transfer The standard model |
Issue Date | 2010 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 4th International Conference on Pairing-based Cryptography (Pairing 2010), Ishikawa, Japan, 13-15 December 2010. In Lecture Notes in Computer Science, 2010, v. 6487, p. 96-115 How to Cite? |
Abstract | 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=1 t ni) for a CNF policy (A1,1 ∨ ... ∨ A1,n1) ∧ ... ∧ (At,1 ∨...∨ At,nt) and in O((k n)) for a k-of-n threshold gate. In our construction, the encrypted record size can be reduced to O(Σ i=1 t ni) for CNF form and O(n) for threshold case. © 2010 Springer-Verlag Berlin Heidelberg. |
Description | LNCS v. 6487 is conference proceedings of Pairing 2010 |
Persistent Identifier | http://hdl.handle.net/10722/137645 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Y | en_HK |
dc.contributor.author | Au, MH | en_HK |
dc.contributor.author | Wong, DS | en_HK |
dc.contributor.author | Huang, Q | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.contributor.author | Cheung, DW | en_HK |
dc.contributor.author | Yiu, SM | en_HK |
dc.date.accessioned | 2011-08-26T14:30:30Z | - |
dc.date.available | 2011-08-26T14:30:30Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | The 4th International Conference on Pairing-based Cryptography (Pairing 2010), Ishikawa, Japan, 13-15 December 2010. In Lecture Notes in Computer Science, 2010, v. 6487, p. 96-115 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/137645 | - |
dc.description | LNCS v. 6487 is conference proceedings of Pairing 2010 | - |
dc.description.abstract | 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=1 t ni) for a CNF policy (A1,1 ∨ ... ∨ A1,n1) ∧ ... ∧ (At,1 ∨...∨ At,nt) and in O((k n)) for a k-of-n threshold gate. In our construction, the encrypted record size can be reduced to O(Σ i=1 t ni) for CNF form and O(n) for threshold case. © 2010 Springer-Verlag Berlin Heidelberg. | en_HK |
dc.language | eng | en_US |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science) | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Access policies | - |
dc.subject | Data-base servers | - |
dc.subject | Database records | - |
dc.subject | Oblivious transfer | - |
dc.subject | The standard model | - |
dc.title | Oblivious transfer with access control: Realizing disjunction without duplication | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0302-9743&volume=6487&spage=96&epage=115&date=2010&atitle=Oblivious+transfer+with+access+control:+Realizing+disjunction+without+duplication | - |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.email | Cheung, DW:dcheung@cs.hku.hk | en_HK |
dc.identifier.email | Yiu, SM:smyiu@cs.hku.hk | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.identifier.authority | Cheung, DW=rp00101 | en_HK |
dc.identifier.authority | Yiu, SM=rp00207 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-17455-1_7 | en_HK |
dc.identifier.scopus | eid_2-s2.0-78650299015 | en_HK |
dc.identifier.hkuros | 190929 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-78650299015&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6487 LNCS | en_HK |
dc.identifier.spage | 96 | en_HK |
dc.identifier.epage | 115 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | The 4th International Conference on Pairing-based Cryptography (Pairing 2010), Ishikawa, Japan, 13-15 December 2010. In Lecture Notes in Computer Science, 2010, v. 6487, p. 96-115 | - |
dc.identifier.scopusauthorid | Zhang, Y=36681041300 | en_HK |
dc.identifier.scopusauthorid | Au, MH=13611295300 | en_HK |
dc.identifier.scopusauthorid | Wong, DS=7401536102 | en_HK |
dc.identifier.scopusauthorid | Huang, Q=35315867100 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |
dc.identifier.scopusauthorid | Cheung, DW=34567902600 | en_HK |
dc.identifier.scopusauthorid | Yiu, SM=7003282240 | en_HK |
dc.identifier.issnl | 0302-9743 | - |