{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T04:08:05Z","timestamp":1744344485185,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":53,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819709410"},{"type":"electronic","value":"9789819709427"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0942-7_12","type":"book-chapter","created":{"date-parts":[[2024,2,25]],"date-time":"2024-02-25T20:02:00Z","timestamp":1708891320000},"page":"227-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PFE: Linear Active Security, Double-Shuffle Proofs, and\u00a0Low-Complexity Communication"],"prefix":"10.1007","author":[{"given":"Hanyu","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangxue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1007\/s00145-020-09346-z","volume":"33","author":"MY Alhassan","year":"2020","unstructured":"Alhassan, M.Y., G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: Efficient and scalable universal circuits. J. Cryptol. 33(3), 1216\u20131271 (2020)","journal-title":"J. Cryptol."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., Schneider, T.: Secure evaluation of private linear branching programs with medical applications. In: ESORICS 2009 (2009)","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: EUROCRYPT 2012 (2012)","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: EUROCRYPT (2011)","DOI":"10.1007\/978-3-642-20465-4_11"},{"issue":"2","key":"12_CR6","first-page":"835","volume":"19","author":"O Bicer","year":"2020","unstructured":"Bicer, O., Bingol, M.A., Kiraz, M.S., Levi, A.: Highly efficient and re-executable private function evaluation with linear complexity. IEEE Trans. Dependable Secure Comput. 19(2), 835\u2013847 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: ACM CCS (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"12_CR8","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: CRYPTO (1992)"},{"key":"12_CR9","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO (1994)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: PKC (2009)","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"issue":"2\u20133","key":"12_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1561\/3300000019","volume":"2","author":"D Evans","year":"2018","unstructured":"Evans, D., Kolesnikov, V., Rosulek, M.: A pragmatic introduction to secure multi-party computation. Found. Trends Priv. Secur. 2(2\u20133), 70\u2013246 (2018)","journal-title":"Found. Trends Priv. Secur."},{"key":"12_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. http:\/\/eprint.iacr.org\/2012\/144"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: Minilego: efficient secure two-party computation from general assumptions. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_32"},{"issue":"10","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1109\/TC.2006.158","volume":"55","author":"KB Frikken","year":"2006","unstructured":"Frikken, K.B., Atallah, M.J., Li, J.: Attribute-based access control with hidden policies and hidden credentials. IEEE Trans. Comput. 55(10), 1259\u20131270 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Frikken, K.B., Atallah, M.J., Zhang, C.: Privacy-preserving credit checking. In: EC (2005)","DOI":"10.1145\/1064009.1064025"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1), 172\u2013188 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.172"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K.: An implementation of a universally verifiable electronic voting scheme based on shuffling. In: FC (2002)","DOI":"10.1007\/3-540-36504-4_2"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: CRYPTO (2001)","DOI":"10.1007\/3-540-44647-8_22"},{"key":"12_CR21","unstructured":"Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: CRYPTO (1984)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s00145-010-9067-9","volume":"23","author":"J Groth","year":"2010","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. Cryptol. 23(4), 546\u2013579 (2010)","journal-title":"J. Cryptol."},{"key":"12_CR24","unstructured":"Groth, J., Ishai, Y.: Sub-linear zero-knowledge argument for correctness of a shuffle. In: EUROCRYPT (2008)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, D., Kiss, \u00c1., Scheidel, L., Schneider, T.: Poster: framework for semi-private function evaluation with application to secure insurance rate calculation. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3363251"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: More efficient universal circuit constructions. In: ASIACRYPT (2017)","DOI":"10.1007\/978-3-319-70697-9_16"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: PKC (2010)","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Holz, M., Kiss, \u00c1., Rathee, D., Schneider, T.: Linear-complexity private function evaluation is practical. In: ESORICS (2020)","DOI":"10.1007\/978-3-030-59013-0_20"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: ACM CCS (2013)","DOI":"10.1145\/2508859.2516662"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Constant-round private function evaluation with linear complexity. In: ASIACRYPT (2011)","DOI":"10.1007\/978-3-642-25385-0_30"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Kiss, \u00c1., Schneider, T.: Valiant\u2019s universal circuit is practical. In: EUROCRYPT (2016)","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"12_CR32","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: FC (2008)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: EUROCRYPT (2007)","DOI":"10.1007\/978-3-540-72540-4_4"},{"issue":"2","key":"12_CR35","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Riva, B.: Blazing fast 2PC in the offline\/online setting with security for malicious adversaries. In: ACM CCS (2015)","DOI":"10.1145\/2810103.2813666"},{"key":"12_CR37","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.: Valiant\u2019s universal circuit: improvements, implementation, and applications, iACR Eprint 2016\/017 (2016)"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Liu, H., Yu, Y., Zhao, S., Zhang, J., Liu, W.: Pushing the limits of valiant\u2019s universal circuits: simpler, tighter and more compact. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_13"},{"key":"12_CR39","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: USENIX Security (2004)"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.S.: How to hide circuits in MPC an efficient framework for private function evaluation. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.S., Smart, N.P.: Actively secure private function evaluation. http:\/\/eprint.iacr.org\/2014\/102","DOI":"10.1007\/978-3-662-45608-8_26"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.S., Smart, N.P.: Actively secure private function evaluation. In: ASIACRYPT (2014)","DOI":"10.1007\/978-3-662-45608-8_26"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"issue":"4","key":"12_CR44","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1093\/comjnl\/bxt019","volume":"57","author":"S Niksefat","year":"2014","unstructured":"Niksefat, S., Sadeghiyan, B., Mohassel, P., Sadeghian, S.S.: ZIDS: a privacy-preserving intrusion detection system using secure two-party computation protocols. Comput. J. 57(4), 494\u2013509 (2014)","journal-title":"Comput. J."},{"key":"12_CR45","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT (1999)"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Shelat, A., Shen, C.: Two-output secure computation with malicious adversaries. In: EUROCRYPT (2011)","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Terelius, B., Wikstr\u00f6m, D.: Proofs of restricted shuffles. In: AFRICACRYPT (2010)","DOI":"10.1007\/978-3-642-12678-9_7"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: STOC (1976)","DOI":"10.1145\/800113.803649"},{"issue":"1","key":"12_CR49","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM 15(1), 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Zhao, S., Yu, Y., Zhang, J., Liu, H.: Valiant\u2019s universal circuits revisited: an overall improvement and a lower bound. In: ASIACRYPT (2019)","DOI":"10.1007\/978-3-030-34578-5_15"},{"key":"12_CR53","unstructured":"Zhu, R., Huang, Y., Katz, J., Shelat, A.: The cut-and-choose game and its application to cryptographic protocols. In: USENIX Security (2016)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0942-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T11:10:39Z","timestamp":1744283439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0942-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709410","9789819709427"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0942-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/link.springer.com\/conference\/cisc","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":"152","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":"38","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":"7","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":"25% - 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","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","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)"}}]}}