{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:15:29Z","timestamp":1763507729763},"reference-count":45,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"2","license":[{"start":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:00:00Z","timestamp":1519084800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A functional credential allows a user to anonymously prove possession of a set of attributes that fulfills a certain policy. The policies are arbitrary polynomially computable predicates that are evaluated over arbitrary attributes. The key feature of this primitive is the delegation of verification to third parties, called designated verifiers. The delegation protects the<jats:italic>privacy of the policy<\/jats:italic>: A designated verifier can verify that a user satisfies a certain policy without learning anything about the policy itself. We illustrate the usefulness of this property in different applications, including outsourced databases with access control. We present a new framework to construct functional credentials that does not require (non-interactive) zero-knowledge proofs. This is important in settings where the statements are complex and thus the resulting zero-knowledge proofs are not efficient. Our construction is based on any predicate encryption scheme and the security relies on standard assumptions. A complexity analysis and an experimental evaluation confirm the practicality of our approach.<\/jats:p>","DOI":"10.1515\/popets-2018-0013","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T10:49:28Z","timestamp":1519728568000},"page":"64-84","source":"Crossref","is-referenced-by-count":11,"title":["Functional Credentials"],"prefix":"10.56553","volume":"2018","author":[{"given":"Dominic","family":"Deuber","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}]},{"given":"Matteo","family":"Maffei","sequence":"additional","affiliation":[{"name":"TU Wien"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}]},{"given":"Max","family":"Rabkin","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[{"name":"Aarhus University"}]}],"member":"35752","published-online":{"date-parts":[[2018,2,20]]},"reference":[{"key":"2021040906181165608_j_popets-2018-0013_ref_001_w2aab3b7b5b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] T. Acar and L. Nguyen. Revocation for delegatable anonymous credentials. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, PKC 2011, volume 6571 of LNCS, pages 423\u2013440, Taormina, Italy, Mar. 6\u20139, 2011. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-19379-8_26"},{"key":"2021040906181165608_j_popets-2018-0013_ref_002_w2aab3b7b5b1b6b1ab1ab2Aa","unstructured":"[2] M. H. Au, A. Kapadia, and W. Susilo. BLACR: TTP-free blacklistable anonymous credentials with reputation. In NDSS 2012, San Diego, California, USA, Feb. 5\u20138, 2012. The Internet Society."},{"key":"2021040906181165608_j_popets-2018-0013_ref_003_w2aab3b7b5b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] M. Backes, S. Meiser, and D. Schr\u00f6der. Delegatable functional signatures. In C.-M. Cheng, K.-M. Chung, G. Persiano, and B.-Y. Yang, editors, PKC 2016, Part I, volume 9614 of LNCS, pages 357\u2013386, Taipei, Taiwan, Mar. 6\u20139, 2016. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-49384-7_14"},{"key":"2021040906181165608_j_popets-2018-0013_ref_004_w2aab3b7b5b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham. Randomizable proofs and delegatable anonymous credentials. In S. Halevi, editor, CRYPTO 2009, volume 5677 of LNCS, pages 108\u2013125, Santa Barbara, CA, USA, Aug. 16\u201320, 2009. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"2021040906181165608_j_popets-2018-0013_ref_005_w2aab3b7b5b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya. P-signatures and noninteractive anonymous credentials. In R. Canetti, editor, TCC 2008, volume 4948 of LNCS, pages 356\u2013374, San Francisco, CA, USA, Mar. 19\u201321, 2008. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-78524-8_20"},{"key":"2021040906181165608_j_popets-2018-0013_ref_006_w2aab3b7b5b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In V. Ashby, editor, ACM CCS 93, pages 62\u201373, Fairfax, Virginia, USA, Nov. 3\u20135, 1993. ACM Press.","DOI":"10.1145\/168588.168596"},{"key":"2021040906181165608_j_popets-2018-0013_ref_007_w2aab3b7b5b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] J. Bethencourt, A. Sahai, and B. Waters. Ciphertext-policy attribute-based encryption. In 2007 IEEE Symposium on Security and Privacy, pages 321\u2013334, Oakland, California, USA, May 20\u201323, 2007. IEEE Computer Society Press.","DOI":"10.1109\/SP.2007.11"},{"key":"2021040906181165608_j_popets-2018-0013_ref_008_w2aab3b7b5b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] E. Boyle, S. Goldwasser, and I. Ivan. Functional signatures and pseudorandom functions. In H. Krawczyk, editor, PKC 2014, volume 8383 of LNCS, pages 501\u2013519, Buenos Aires, Argentina, Mar. 26\u201328, 2014. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"2021040906181165608_j_popets-2018-0013_ref_009_w2aab3b7b5b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] R. W. Bradshaw, J. E. Holt, and K. E. Seamons. Concealing complex policies with hidden credentials. In V. Atluri, B. Pfitzmann, and P. McDaniel, editors, ACM CCS 04, pages 146\u2013157, Washington D.C., USA, Oct. 25\u201329, 2004. ACM Press.","DOI":"10.1145\/1030083.1030104"},{"key":"2021040906181165608_j_popets-2018-0013_ref_010_w2aab3b7b5b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] J. Brandt, I. Damg\u00e5rd, P. Landrock, and T. P. Pedersen. Zero-knowledge authentication scheme with secret key exchange (extended abstract) (rump session). In S. Goldwasser, editor, CRYPTO\u201988, volume 403 of LNCS, pages 583\u2013588, Santa Barbara, CA, USA, Aug. 21\u201325, 1990. Springer, Heidelberg, Germany.","DOI":"10.1007\/0-387-34799-2_43"},{"key":"2021040906181165608_j_popets-2018-0013_ref_011_w2aab3b7b5b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] J. Camenisch, M. Dubovitskaya, R. R. Enderlein, and G. Neven. Oblivious transfer with hidden access control from attribute-based encryption. In I. Visconti and R. D. Prisco, editors, SCN 12, volume 7485 of LNCS, pages 559\u2013579, Amalfi, Italy, Sept. 5\u20137, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-32928-9_31"},{"key":"2021040906181165608_j_popets-2018-0013_ref_012_w2aab3b7b5b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] J. Camenisch, M. Dubovitskaya, K. Haralambiev, and M. Kohlweiss. Composable and modular anonymous credentials: Definitions and practical constructions. In T. Iwata and J. H. Cheon, editors, ASIACRYPT 2015, Part II, volume 9453 of LNCS, pages 262\u2013288, Auckland, New Zealand, Nov. 30 \u2013 Dec. 3, 2015. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"2021040906181165608_j_popets-2018-0013_ref_013_w2aab3b7b5b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] J. Camenisch, M. Dubovitskaya, G. Neven, and G. M. Zaverucha. Oblivious transfer with hidden access control policies. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, PKC 2011, volume 6571 of LNCS, pages 192\u2013209, Taormina, Italy, Mar. 6\u20139, 2011. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-19379-8_12"},{"key":"2021040906181165608_j_popets-2018-0013_ref_014_w2aab3b7b5b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] J. Camenisch, M. Kohlweiss, and C. Soriente. Solving revocation with efficient update of anonymous credentials. In J. A. Garay and R. D. Prisco, editors, SCN 10, volume 6280 of LNCS, pages 454\u2013471, Amalfi, Italy, Sept. 13\u201315, 2010. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-15317-4_28"},{"key":"2021040906181165608_j_popets-2018-0013_ref_015_w2aab3b7b5b1b6b1ab1ac15Aa","unstructured":"[15] J. Camenisch, S. Krenn, A. Lehmann, G. L. Mikkelsen, G. Neven, and M. \u00d8. Pedersen. Formal treatment of privacy-enhancing credential systems. Cryptology ePrint Archive, Report 2014\/708, 2014. http:\/\/eprint.iacr.org\/2014\/708."},{"key":"2021040906181165608_j_popets-2018-0013_ref_016_w2aab3b7b5b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] J. Camenisch and A. Lehmann. (Un)linkable pseudonyms for governmental databases. In I. Ray, N. Li, and C. Kruegel:, editors, ACM CCS 15, pages 1467\u20131479, Denver, CO, USA, Oct. 12\u201316, 2015. ACM Press.","DOI":"10.1145\/2810103.2813658"},{"key":"2021040906181165608_j_popets-2018-0013_ref_017_w2aab3b7b5b1b6b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"[17] J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In B. Pfitzmann, editor, EUROCRYPT 2001, volume 2045 of LNCS, pages 93\u2013118, Innsbruck, Austria, May 6\u201310, 2001. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"2021040906181165608_j_popets-2018-0013_ref_018_w2aab3b7b5b1b6b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"[18] J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, SCN 02, volume 2576 of LNCS, pages 268\u2013289, Amalfi, Italy, Sept. 12\u201313, 2003. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-36413-7_20"},{"key":"2021040906181165608_j_popets-2018-0013_ref_019_w2aab3b7b5b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In M. Franklin, editor, CRYPTO 2004, volume 3152 of LNCS, pages 56\u201372, Santa Barbara, CA, USA, Aug. 15\u201319, 2004. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"2021040906181165608_j_popets-2018-0013_ref_020_w2aab3b7b5b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] J. Camenisch and E. Van Herreweghen. Design and implementation of the idemix anonymous credential system. In V. Atluri, editor, ACM CCS 02, pages 21\u201330, Washington D.C., USA, Nov. 18\u201322, 2002. ACM Press.","DOI":"10.1145\/586110.586114"},{"key":"2021040906181165608_j_popets-2018-0013_ref_021_w2aab3b7b5b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] S. Canard and R. Lescuyer. Anonymous credentials from (indexed) aggregate signatures. In DIM\u201911, Proceedings of the 2013 ACM Workshop on Digital Identity Management, Chicago, IL, USA - October 21, 2011, 2011.","DOI":"10.1145\/2046642.2046655"},{"key":"2021040906181165608_j_popets-2018-0013_ref_022_w2aab3b7b5b1b6b1ab1ac22Aa","doi-asserted-by":"crossref","unstructured":"[22] S. Canard and R. Lescuyer. Protecting privacy by sanitizing personal data: a new approach to anonymous credentials. In K. Chen, Q. Xie, W. Qiu, N. Li, and W.-G. Tzeng, editors, ASIACCS 13, pages 381\u2013392, Hangzhou, China, May 8\u201310, 2013. ACM Press.","DOI":"10.1145\/2484313.2484363"},{"key":"2021040906181165608_j_popets-2018-0013_ref_023_w2aab3b7b5b1b6b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] R. Canetti and M. Fischlin. Universally composable commitments. In J. Kilian, editor, CRYPTO 2001, volume 2139 of LNCS, pages 19\u201340, Santa Barbara, CA, USA, Aug. 19\u201323, 2001. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"2021040906181165608_j_popets-2018-0013_ref_024_w2aab3b7b5b1b6b1ab1ac24Aa","unstructured":"[24] D. Chaum. Verification by anonymous monitors. In A. Gersho, editor, CRYPTO\u201981, volume ECE Report 82-04, pages 138\u2013139, Santa Barbara, CA, USA, 1981. U.C. Santa Barbara, Dept. of Elec. and Computer Eng."},{"key":"2021040906181165608_j_popets-2018-0013_ref_025_w2aab3b7b5b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] D. Chaum. Blind signatures for untraceable payments. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, CRYPTO\u201982, pages 199\u2013203, Santa Barbara, CA, USA, 1982. Plenum Press, New York, USA.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"2021040906181165608_j_popets-2018-0013_ref_026_w2aab3b7b5b1b6b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] L. Dagum and R. Menon. Openmp: An industry-standard api for shared-memory programming. IEEE Comput. Sci. Eng., 5(1):46\u201355, Jan. 1998.10.1109\/99.660313","DOI":"10.1109\/99.660313"},{"key":"2021040906181165608_j_popets-2018-0013_ref_027_w2aab3b7b5b1b6b1ab1ac27Aa","doi-asserted-by":"crossref","unstructured":"[27] I. Damg\u00e5rd and J. B. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In M. Yung, editor, CRYPTO 2002, volume 2442 of LNCS, pages 581\u2013596, Santa Barbara, CA, USA, Aug. 18\u201322, 2002. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-45708-9_37"},{"key":"2021040906181165608_j_popets-2018-0013_ref_028_w2aab3b7b5b1b6b1ab1ac28Aa","unstructured":"[28] K. B. Frikken, J. Li, and M. J. Atallah. Trust negotiation with hidden credentials, hidden policies, and policy cycles. In NDSS 2006, San Diego, California, USA, Feb. 2\u20133, 2006. The Internet Society."},{"key":"2021040906181165608_j_popets-2018-0013_ref_029_w2aab3b7b5b1b6b1ab1ac29Aa","unstructured":"[29] G. Fuchsbauer, C. Hanser, and D. Slamanig. Structurepreserving signatures on equivalence classes and constantsize anonymous credentials. Cryptology ePrint Archive, Report 2014\/944, 2014. http:\/\/eprint.iacr.org\/2014\/944."},{"key":"2021040906181165608_j_popets-2018-0013_ref_030_w2aab3b7b5b1b6b1ab1ac30Aa","doi-asserted-by":"crossref","unstructured":"[30] C. Gentry. Fully homomorphic encryption using ideal lattices. In M. Mitzenmacher, editor, 41st ACM STOC, pages 169\u2013178, Bethesda, Maryland, USA, May 31 \u2013 June 2, 2009. ACM Press.","DOI":"10.1145\/1536414.1536440"},{"key":"2021040906181165608_j_popets-2018-0013_ref_031_w2aab3b7b5b1b6b1ab1ac31Aa","doi-asserted-by":"crossref","unstructured":"[31] S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281\u2013308, Apr. 1988.","DOI":"10.1137\/0217017"},{"key":"2021040906181165608_j_popets-2018-0013_ref_032_w2aab3b7b5b1b6b1ab1ac32Aa","doi-asserted-by":"crossref","unstructured":"[32] J. Groth and A. Sahai. Efficient non-interactive proof systems for bilinear groups. In N. P. Smart, editor, EUROCRYPT 2008, volume 4965 of LNCS, pages 415\u2013432, Istanbul, Turkey, Apr. 13\u201317, 2008. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"2021040906181165608_j_popets-2018-0013_ref_033_w2aab3b7b5b1b6b1ab1ac33Aa","doi-asserted-by":"crossref","unstructured":"[33] C. Hanser and D. Slamanig. Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In P. Sarkar and T. Iwata, editors, ASIACRYPT 2014, Part I, volume 8873 of LNCS, pages 491\u2013511, Kaoshiung, Taiwan, R.O.C., Dec. 7\u201311, 2014. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"2021040906181165608_j_popets-2018-0013_ref_034_w2aab3b7b5b1b6b1ab1ac34Aa","doi-asserted-by":"crossref","unstructured":"[34] J. Katz, A. Sahai, and B. Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In N. P. Smart, editor, EUROCRYPT 2008, volume 4965 of LNCS, pages 146\u2013162, Istanbul, Turkey, Apr. 13\u201317, 2008. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"2021040906181165608_j_popets-2018-0013_ref_035_w2aab3b7b5b1b6b1ab1ac35Aa","doi-asserted-by":"crossref","unstructured":"[35] V. Kolesnikov, H. Krawczyk, Y. Lindell, A. J. Malozemoff, and T. Rabin. Attribute-based key exchange with general policies. In ACM CCS 16, pages 1451\u20131463. ACM Press, 2016.","DOI":"10.1145\/2976749.2978359"},{"key":"2021040906181165608_j_popets-2018-0013_ref_036_w2aab3b7b5b1b6b1ab1ac36Aa","unstructured":"[36] B. Lynn. The pairing-based cryptography (pbc) library, 2010."},{"key":"2021040906181165608_j_popets-2018-0013_ref_037_w2aab3b7b5b1b6b1ab1ac37Aa","doi-asserted-by":"crossref","unstructured":"[37] M. Maffei, G. Malavolta, M. Reinert, and D. Schr\u00f6der. Privacy and access control for outsourced personal records. In 2015 IEEE Symposium on Security and Privacy, pages 341\u2013358, San Jose, California, USA, May 17\u201321, 2015. IEEE Computer Society Press.","DOI":"10.1109\/SP.2015.28"},{"key":"2021040906181165608_j_popets-2018-0013_ref_038_w2aab3b7b5b1b6b1ab1ac38Aa","doi-asserted-by":"crossref","unstructured":"[38] T. Nishide, K. Yoneyama, and K. Ohta. Attribute-based encryption with partially hidden encryptor-specified access structures. In S. M. Bellovin, R. Gennaro, A. D. Keromytis, and M. Yung, editors, ACNS 08, volume 5037 of LNCS, pages 111\u2013129, New York, NY, USA, June 3\u20136, 2008. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-68914-0_7"},{"key":"2021040906181165608_j_popets-2018-0013_ref_039_w2aab3b7b5b1b6b1ab1ac39Aa","doi-asserted-by":"crossref","unstructured":"[39] T. Okamoto and K. Takashima. Hierarchical predicate encryption for inner-products. In M. Matsui, editor, ASIACRYPT 2009, volume 5912 of LNCS, pages 214\u2013231, Tokyo, Japan, Dec. 6\u201310, 2009. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"2021040906181165608_j_popets-2018-0013_ref_040_w2aab3b7b5b1b6b1ab1ac40Aa","doi-asserted-by":"crossref","unstructured":"[40] T. Okamoto and K. Takashima. Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. In D. Lin, G. Tsudik, and X. Wang, editors, CANS 11, volume 7092 of LNCS, pages 138\u2013159, Sanya, China, Dec. 10\u201312, 2011. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-25513-7_11"},{"key":"2021040906181165608_j_popets-2018-0013_ref_041_w2aab3b7b5b1b6b1ab1ac41Aa","doi-asserted-by":"crossref","unstructured":"[41] B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In R. Cramer, editor, TCC 2012, volume 7194 of LNCS, pages 422\u2013439, Taormina, Sicily, Italy, Mar. 19\u201321, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"2021040906181165608_j_popets-2018-0013_ref_042_w2aab3b7b5b1b6b1ab1ac42Aa","doi-asserted-by":"crossref","unstructured":"[42] C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161\u2013174, 1991.10.1007\/BF00196725","DOI":"10.1007\/BF00196725"},{"key":"2021040906181165608_j_popets-2018-0013_ref_043_w2aab3b7b5b1b6b1ab1ac43Aa","doi-asserted-by":"crossref","unstructured":"[43] B. Waters. Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, PKC 2011, volume 6571 of LNCS, pages 53\u201370, Taormina, Italy, Mar. 6\u20139, 2011. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"2021040906181165608_j_popets-2018-0013_ref_044_w2aab3b7b5b1b6b1ab1ac44Aa","doi-asserted-by":"crossref","unstructured":"[44] R. Wei and D. Ye. Delegate predicate encryption and its application to anonymous authentication. In W. Li, W. Susilo, U. K. Tupakula, R. Safavi-Naini, and V. Varadharajan, editors, ASIACCS 09, pages 372\u2013375, Sydney, Australia, Mar. 10\u201312, 2009. ACM Press.","DOI":"10.1145\/1533057.1533107"},{"key":"2021040906181165608_j_popets-2018-0013_ref_045_w2aab3b7b5b1b6b1ab1ac45Aa","doi-asserted-by":"crossref","unstructured":"[45] S. Yamada, N. Attrapadung, B. Santoso, J. C. N. Schuldt, G. Hanaoka, and N. Kunihiro. Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication. In M. Fischlin, J. Buchmann, and M. Manulis, editors, PKC 2012, volume 7293 of LNCS, pages 243\u2013261, Darmstadt, Germany, May 21\u201323, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-30057-8_15"}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2018\/2\/article-p64.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2018-0013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T23:04:41Z","timestamp":1660518281000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2018\/popets-2018-0013.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,20]]},"references-count":45,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,2,20]]},"published-print":{"date-parts":[[2018,4,1]]}},"alternative-id":["10.1515\/popets-2018-0013"],"URL":"https:\/\/doi.org\/10.1515\/popets-2018-0013","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,20]]}}}