{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:36:11Z","timestamp":1742945771720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031192074"},{"type":"electronic","value":"9783031192081"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19208-1_40","type":"book-chapter","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:03:45Z","timestamp":1668643425000},"page":"491-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Post Quantum Random Oblivious Transfer Based on\u00a0Lattice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5226-3190","authenticated-orcid":false,"given":"Lidong","family":"Xu","sequence":"first","affiliation":[]},{"given":"Mingqiang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.3390\/e23081001","volume":"23","author":"B Costa","year":"2021","unstructured":"Costa, B., Branco, P., Goulao, M., Lemus, M., Mateus, P.: Randomized oblivious transfer for secure multiparty computation. Entropy 23, 1001 (2021)","journal-title":"Entropy"},{"issue":"3","key":"40_CR4","first-page":"422","volume":"18","author":"W Yang","year":"2009","unstructured":"Yang, W., Huang, L.S., Wang, Q.Y., Luo, Y.L.: Quantum bit commitment based on qubit oblivious transfer. Chin. J. Electron. 18(3), 422\u2013426 (2009)","journal-title":"Chin. J. Electron."},{"key":"40_CR5","unstructured":"Yang, L.: Bit commitment protocol based on random oblivious transfer via quantum channel. arXiv: 1306.5863 (2013)"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"1990","DOI":"10.3390\/app8101990","volume":"8","author":"YQ Song","year":"2018","unstructured":"Song, Y.Q., Yang, L.: Practical quantum bit commitment protocol based on quantum oblivious transfer. Appl. Sci. 8, 1990 (2018)","journal-title":"Appl. Sci."},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-light: lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-Light: lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"40_CR9","unstructured":"Rabin, M.O.: How to Exchange Secrets by Oblivious Transfer. Technical Memo TR-81 (1981)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"40_CR11","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_33","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-76900-2_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"M Green","year":"2007","unstructured":"Green, M., Hohenberger, S.: Blind identity-based encryption and simulatable oblivious transfer. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 265\u2013282. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_16"},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1007\/s11277-017-4664-7","volume":"97","author":"H Jannati","year":"2017","unstructured":"Jannati, H., Bahrak, B.: An oblivious transfer protocol based on elgamal encryption for preserving location privacy. Wireless Pers. Commun. 97(2), 3113\u20133123 (2017). https:\/\/doi.org\/10.1007\/s11277-017-4664-7","journal-title":"Wireless Pers. Commun."},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical Homomorphic Encryption for Quantum Circuits. SIAM J. Comput. 189 (2020)","DOI":"10.1137\/18M1231055"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical Verification of Quantum Computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 259\u2013267 (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Alexandru, C., L$$\\acute{e}$$o, C., Elham, K., Petros, W.: On the possibility of classical client blind quantum computing. Cryptography 5(1), 3 (2021)","DOI":"10.3390\/cryptography5010003"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: ACM Symposium on Theory of Computing, 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-25385-0_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"S Agrawal","year":"2011","unstructured":"Agrawal, S., Freeman, D.M., Vaikuntanathan, V.: Functional encryption for inner product predicates from learning with errors. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 21\u201340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_2"},{"key":"40_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: IEEE Symposium on Foundations of Computer Science, p. 136 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"40_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"issue":"3","key":"40_CR23","first-page":"125","volume":"32","author":"FH Wang","year":"2011","unstructured":"Wang, F.H., Hu, P.Y., Liu, Z.H.: Lattice-based oblivious transfer protocol. J. Commun. 32(3), 125\u2013130 (2011)","journal-title":"J. Commun."},{"key":"40_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-319-70694-8_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"B Libert","year":"2017","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Adaptive oblivious transfer with access control from lattice assumptions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 533\u2013563. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_19"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19208-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:37:48Z","timestamp":1668645468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19208-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031192074","9783031192081"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19208-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2022\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"265","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":"95","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":"62","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":"36% - 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":"4","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":"8","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)"}}]}}