Masayuki Abe
ABSTRACT
In this paper, we provide the first scheme that realises an attribute-based access control system for static resources that offers maximal privacy and is secure in the universal composability framework (UC). More precisely, we offer a protocol for adaptive oblivious transfer, where the sender can enforce an attribute-based access control policy for each record and nevertheless learns neither which record a user retrieves nor which attributes a user has. As additional results we provide a new structure-preserving signature scheme from the SXDH assumption and a new universally composable adaptive oblivious transfer protocol that is secure under two DDH-like assumptions and is the most efficient one secure under ``non $q$-type'' assumptions. We believe the new signature scheme to be of independent interest as a building block that is compatible with Groth-Sahai non-interactive zero-knowledge proofs.
- M.Gerbush, A.Lewko, A.O'Neill, B. Waters. Dual Form Signatures: An Approach for ProvingSecurity from Static Assumptions. In ASIACRYPT 2012. Google Scholar
Digital Library
- M.Abe, M.Chase, B.David, M.Kohlweiss, R.Nishimaki, and M.Ohkubo. Constant-size structure-preserving signatures: Generic constructions and simple assumptions. In ASIACRYPT 2012. Google ScholarDigital Library
- M.Belenkiy, M.Chase, M.Kohlweiss, and A.Lysyanskaya. P-signatures and noninteractive anonymous credentials. In TCC 2008. Google ScholarDigital Library
- D.Boneh, X.Boyen, and H.Shacham. Short group signatures. In CRYPTO 2004.Google ScholarCross Ref
- J.Camenisch, M.Dubovitskaya, and G.Neven. Oblivious transfer with access control. In ACM CCS 2009. Google ScholarDigital Library
- J.Camenisch, S.Krenn, and V.Shoup. A framework for practical universally composable zero-knowledge protocols. In ASIACRYPT 2011. Google ScholarDigital Library
- J.Camenisch and A.Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In EUROCRYPT 2001. Google ScholarDigital Library
- J.Camenisch, G.Neven, and A.Shelat. Simulatable adaptive oblivious transfer. In EUROCRYPT 2007. Google ScholarDigital Library
- R.Canetti. A unified framework for analyzing security of protocols. In Electronic Colloquium on Computational Complexity (ECCC), 8(16), 2001.Google Scholar
- R.Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd FOCS, pages 136--145, 2001. IEEE Computer Society Press. Google ScholarDigital Library
- R.Canetti. Universally composable security: A new paradigm for cryptograpic protocols. Cryptology ePrint Archive, Report 2000/067, 2005.Google Scholar
- R.Canetti and M.Fischlin. Universally composable commitments. In CRYPTO 2001. Google ScholarDigital Library
- R.Canetti, E.Kushilevitz, and Y.Lindell. On the limitations of universally composable two-party computation without set-up assumptions. In J. Cryptology, 19(2):135--167, 2006. Google ScholarDigital Library
- R.Canetti, Y.Lindell, R.Ostrovsky, and A.Sahai. Universally composable two-party and multi-party secure computation. In 34th ACM STOC 2002. Google ScholarDigital Library
- M.Chase and M.Kohlweiss. A domain transformation for structure-preserving signatures on group elements, 2011. http://eprint.iacr.org/2011/342.Google Scholar
- S. E.Coull, M.Green, and S.Hohenberger. Controlling access to an oblivious database using stateful anonymous credentials. In PKC 2009. Google ScholarDigital Library
- I.Damgård, J. B.Nielsen, and C.Orlandi. Essentially optimal universally composable oblivious transfer. In ICISC 2008.Google Scholar
- J. A.Garay, P. MacKenzie, and K. Yang. Efficient and universally composable committed oblivious transfer and applications. In TCC 2004.Google Scholar
- Juan A.Garay, Philip D.MacKenzie, and K.Yang. Strengthening zero-knowledge protocols using signatures. In EUROCRYPT 2003. Google ScholarDigital Library
- M.Green and S.Hohenberger. Universally composable adaptive oblivious transfer. In ASIACRYPT 2008. Google ScholarDigital Library
- M.Green and S.Hohenberger. Practical adaptive oblivious transfer from a simple assumption. In TCC 2011. Google ScholarDigital Library
- J.Groth and A.Sahai. Efficient non-interactive proof systems for bilinear groups. In EUROCRYPT 2008. Google ScholarDigital Library
- C.Peikert, V.Vaikuntanathan, and B.Waters. A framework for efficient and composable oblivious transfer. In CRYPTO 2008. Google ScholarDigital Library
- M. O. Rabin. How to exchange secrets by oblivious transfer. Technical report, Harvard University, 1981. TR-81.Google Scholar
- A.Rial, M.Kohlweiss, and B.Preneel. Universally composable adaptive priced oblivious transfer. In Pairing 2009. Google ScholarDigital Library
- B.Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005. Google ScholarDigital Library
- B.Zhang. Simulatable adaptive oblivious transfer with statistical receiver's privacy. In ProvSec. Google ScholarDigital Library
- A.B.Lewko. Tools for simulating features of composite order bilinear groups in the prime order setting. In EUROCRYPT 2012. Google ScholarDigital Library
- T.Okamoto and K.Takashima. Hierarchical predicate encryption for inner-products. In ASIACRYPT 2009. Google ScholarDigital Library
- J.Chen, H.Huang, H.W.Lim, S.Ling, H.Wang and H.Wee Compact IBE and Signatures via Asymmetric Pairings In PAIRING 2012. Google ScholarDigital Library
- J.Camenisch, M.Dubovitskaya, G.Neven, and G.M.Zaverucha. Oblivious transfer with hidden access control policies. In PKC 2011. Google ScholarDigital Library
- M.Abe, G.Fuchsbauer, J.Groth, K.Haralambiev, and M.Ohkubo. Structure-preserving signatures and commitments to group elements. In CRYPTO 2010. Google ScholarDigital Library
- Ivan Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000.Google ScholarCross Ref
Index Terms
- Universally composable adaptive oblivious transfer (with access control) from standard assumptions
Recommendations
Oblivious transfer with access control
CCS '09: Proceedings of the 16th ACM conference on Computer and communications securityWe present a protocol for anonymous access to a database where the different records have different access control permissions. These permissions could be attributes, roles, or rights that the user needs to have in order to access the record. Our ...
Universally composable oblivious transfer from ideal lattice
As a fundamental cryptographic primitive, oblivious transfer (OT) is developed for the sake of efficient usability and combinational feasibility. However, most OT protocols are built upon some quantum non-immune cryptosystems by assuming the hardness of ...
Universally composable issuer-free adaptive oblivious transfer with access policy
In today's Internet world, security, privacy and efficiency are three prime concerns in designing any cryptographic protocol. Adaptive oblivious transfer with access policy AOT-AP is widely used in oblivious search of privacy preserving databases in ...
Comments