{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:20:21Z","timestamp":1725852021043},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319315492"},{"type":"electronic","value":"9783319315508"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31550-8_12","type":"book-chapter","created":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T10:26:20Z","timestamp":1458642380000},"page":"183-199","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Implementation of AND, OR and NOT Operators for ABCs"],"prefix":"10.1007","author":[{"given":"Antonio","family":"de la Piedra","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,16]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-45022-X_32","volume-title":"Automata, Languages and Programming","author":"A Akhavi","year":"2000","unstructured":"Akhavi, A., Vall\u00e9e, B.: Average Bit-Complexity of Euclidean Algorithms. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 373\u2013387. Springer, Heidelberg (2000)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Crypt. Eng. 3(2), 111\u2013128 (2013)","journal-title":"J. Crypt. Eng."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bichsel, P., Camenisch, J., Gro\u00df, T., Shoup, V.: Anonymous credentials on a standard Java Card. In: ACM Conference on Computer and Communications Security, pp. 600\u2013610 (2009)","DOI":"10.1145\/1653662.1653734"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5931.001.0001","volume-title":"Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy","author":"SA Brands","year":"2000","unstructured":"Brands, S.A.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge (2000)"},{"issue":"1","key":"12_CR5","first-page":"25","volume":"19","author":"J Camenisch","year":"2014","unstructured":"Camenisch, J., Dubovitskaya, M., Enderlein, R.R., Lehmann, A., Neven, G., Paquin, C., Preiss, F.-S.: Concepts and languages for privacy-preserving attribute-based authentication. J. Inf. Sec. Appl. 19(1), 25\u201344 (2014)","journal-title":"J. Inf. Sec. Appl."},{"key":"12_CR6","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-37282-7_4","volume-title":"Policies and Research in Identity Management","author":"J Camenisch","year":"2013","unstructured":"Camenisch, J., Dubovitskaya, M., Lehmann, A., Neven, G., Paquin, C., Preiss, F.-S.: Concepts and languages for privacy-preserving attribute-based authentication. In: Fischer-H\u00fcbner, S., de Leeuw, E., Mitchell, C. (eds.) IDMAN 2013. IFIP AICT, vol. 396, pp. 34\u201352. Springer, Heidelberg (2013)"},{"key":"12_CR7","first-page":"496","volume":"2010","author":"J Camenisch","year":"2010","unstructured":"Camenisch, J., Gro\u00df, T.: Efficient attributes for anonymous credentials (extended version). IACR Cryptol. ePrint Arch. 2010, 496 (2010)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: ACM Conference on Computer and Communications Security, pp. 21\u201330 (2002)","DOI":"10.1145\/586110.586114"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"JL Camenisch","year":"2001","unstructured":"Camenisch, J.L., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 93. Springer, Heidelberg (2001)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"JL Camenisch","year":"2003","unstructured":"Camenisch, J.L., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"JL Camenisch","year":"1997","unstructured":"Camenisch, J.L., Stadler, M.A.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"issue":"10","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: Transaction systems to make big brother obsolete. Commun. ACM 28(10), 1030\u20131044 (1985)","journal-title":"Commun. ACM"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-48969-X_3","volume-title":"Lectures on Data Security","author":"IB Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.B.: Commitment schemes and zero-knowledge protocols. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol. 1561, p. 63. Springer, Heidelberg (1999)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"IB Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"E Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"12_CR17","volume-title":"The Art of Computer Programming, Volume II: Seminumerical Algorithms","author":"DE Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume II: Seminumerical Algorithms, vol. 2, 2nd edn. Addison-Wesley, Boston (1981)","edition":"2"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/978-3-319-12280-9_18","volume-title":"Cryptology and Network Security","author":"A Piedra de la","year":"2014","unstructured":"de la Piedra, A., Hoepman, J.-H., Vullers, P.: Towards a full-featured implementation of attribute based credentials on smart cards. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 270\u2013289. Springer, Heidelberg (2014)"},{"key":"12_CR19","unstructured":"Sterckx, M., Gierlichs, B., Preneel, B., Verbauwhede, I.: Efficient implementation of anonymous credentials on java card smart cards. In: 1st IEEE International Workshop on Information Forensics and Security (WIFS), pp. 106\u2013110. IEEE, London, UK, 2009 (2009)"},{"key":"12_CR20","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-37282-7_5","volume-title":"Policies and Research in Identity Management","author":"P Vullers","year":"2013","unstructured":"Vullers, P., Alp\u00e1r, G.: Efficient selective disclosure on smart cards using idemix. In: Fischer-H\u00fcbner, S., de Leeuw, E., Mitchell, C. (eds.) IDMAN 2013. IFIP AICT, vol. 396, pp. 53\u201367. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31550-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:19:31Z","timestamp":1559409571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31550-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319315492","9783319315508"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31550-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}