{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:55:29Z","timestamp":1726037729501},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030252823"},{"type":"electronic","value":"9783030252830"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25283-0_2","type":"book-chapter","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T14:02:57Z","timestamp":1563544977000},"page":"23-43","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Anonymous Single-Round Server-Aided Verification"],"prefix":"10.1007","author":[{"given":"Elena","family":"Pagnin","sequence":"first","affiliation":[]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-44750-4_5","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"P B\u00e9guin","year":"1995","unstructured":"B\u00e9guin, P., Quisquater, J.-J.: Fast server-aided RSA Signatures secure against active attacks. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 57\u201369. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-44750-4_5"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Benabbas","year":"2011","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111\u2013131. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22792-9_7"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11745853_15","volume-title":"Public Key Cryptography - PKC 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on computational diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 229\u2013240. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11745853_15"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-07536-5_32","volume-title":"Applied Cryptography and Network Security","author":"S Canard","year":"2014","unstructured":"Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 549\u2013565. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-07536-5_32"},{"issue":"6","key":"2_CR7","first-page":"1054","volume":"18","author":"Z Cao","year":"2016","unstructured":"Cao, Z., Liu, L., Markowitch, O.: On two kinds of flaws in some server-aided verification schemes. Int. J. Netw. Secur. 18(6), 1054\u20131059 (2016)","journal-title":"Int. J. Netw. Secur."},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.istr.2012.10.007","volume":"17","author":"SS Chow","year":"2013","unstructured":"Chow, S.S., Au, M.H., Susilo, W.: Server-aided signatures verification secure against collusion attack. Inf. Secur. Tech. Rep. 17(3), 46\u201357 (2013)","journal-title":"Inf. Secur. Tech. Rep."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Costello, C., et al.: Geppetto: versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy (SP), pp. 253\u2013270. IEEE (2015)","DOI":"10.1109\/SP.2015.23"},{"key":"2_CR10","unstructured":"Derler, D., Slamanig, D.: Key-homomorphic signatures and applications to multiparty signatures. Technical report, IACR Cryptology ePrint Archive 2016, 792 (2016)"},{"key":"2_CR11","unstructured":"Ding, X., Mazzocchi, D., Tsudik, G.: Experimenting with server-aided signatures. In: NDSS (2002)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 844\u2013855. ACM (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-71677-8_3","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"M Fischlin","year":"2007","unstructured":"Fischlin, M.: Anonymous signatures made easy. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 31\u201342. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71677-8_3"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/11593447_33","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Girault","year":"2005","unstructured":"Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605\u2013623. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11593447_33"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-16763-3_12","volume-title":"Smart Card Research and Advanced Applications","author":"A Guillevic","year":"2015","unstructured":"Guillevic, A., Vergnaud, D.: Algorithms for outsourcing pairing computation. In: Joye, M., Moradi, A. (eds.) CARDIS 2014. LNCS, vol. 8968, pp. 193\u2013211. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-16763-3_12"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Guo, F., Mu, Y., Susilo, W., Varadharajan,V.: Server-aided signature verification for lightweight devices. Comput. J. bxt003 (2013)","DOI":"10.1093\/comjnl\/bxt003"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-49264-X_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1995","author":"CH Lim","year":"1995","unstructured":"Lim, C.H., Lee, P.J.: Server(Prover\/Signer)-aided verification of identity proofs and signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 64\u201378. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-49264-X_6"},{"key":"2_CR19","unstructured":"Pagnin, E., Mitrokotsa, A., Tanaka, K.: Anonymous single-round server-aided verification (2017). \n                      http:\/\/eprint.iacr.org\/2017\/794"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy (SP), pp. 238\u2013252. IEEE (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"2_CR21","first-page":"3446","volume":"7","author":"B Wang","year":"2012","unstructured":"Wang, B.: A server-aided verification signature scheme without random oracles. Int. Rev. Comput. Softw. 7, 3446 (2012)","journal-title":"Int. Rev. Comput. Softw."},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.mcm.2011.01.054","volume":"55","author":"Z Wang","year":"2012","unstructured":"Wang, Z.: A new construction of the server-aided verification signature scheme. Math. Comput. Model. 55(1), 97\u2013101 (2012)","journal-title":"Math. Comput. Model."},{"issue":"2","key":"2_CR23","first-page":"158","volume":"10","author":"Z Wang","year":"2010","unstructured":"Wang, Z., Wang, L., Yang, Y., Hu, Z.: Comment on Wu et al\u2019s server-aided verification signature schemes. IJ Netw. Secur. 10(2), 158\u2013160 (2010)","journal-title":"IJ Netw. Secur."},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11426639_7"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-88733-1_10","volume-title":"Provable Security","author":"W Wu","year":"2008","unstructured":"Wu, W., Mu, Y., Susilo, W., Huang, X.: Server-aided verification signatures: definitions and new constructions. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 141\u2013155. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-88733-1_10"},{"issue":"7","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1016\/j.camwa.2011.01.036","volume":"61","author":"W Wu","year":"2011","unstructured":"Wu, W., Mu, Y., Susilo, W., Huang, X.: Provably secure server-aided verification signatures. Comput. Math. Appl. 61(7), 1705\u20131723 (2011)","journal-title":"Comput. Math. Appl."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11745853_23","volume-title":"Public Key Cryptography - PKC 2006","author":"G Yang","year":"2006","unstructured":"Yang, G., Wong, D.S., Deng, X., Wang, H.: Anonymous signature schemes. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 347\u2013363. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11745853_23"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277\u2013290. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24632-9_20"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25283-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T14:22:38Z","timestamp":1563546158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25283-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030252823","9783030252830"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25283-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latincrypt.matcom.uh.cu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"iChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"contains 1 invited paper","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}