{"id":"https://openalex.org/W2572799557","doi":"https://doi.org/10.1007/978-3-662-53641-4_21","title":"More Efficient Constant-Round Multi-party Computation from BMR and SHE","display_name":"More Efficient Constant-Round Multi-party Computation from BMR and SHE","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2572799557","doi":"https://doi.org/10.1007/978-3-662-53641-4_21","mag":"2572799557"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-53641-4_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-53641-4_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/b09e7275-49c5-483a-90d9-84e1b24bb385","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033036383","display_name":"Yehuda Lindell","orcid":"https://orcid.org/0000-0002-8176-690X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yehuda Lindell","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013420832","display_name":"Nigel P. Smart","orcid":"https://orcid.org/0000-0003-3567-3304"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nigel P. Smart","raw_affiliation_strings":["University of Bristol, Bristol, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064057263","display_name":"Eduardo Soria-V\u00e1zquez","orcid":"https://orcid.org/0000-0002-4882-0230"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eduardo Soria-Vazquez","raw_affiliation_strings":["University of Bristol, Bristol, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033036383"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.4943,"has_fulltext":false,"cited_by_count":366,"citation_normalized_percentile":{"value":0.9496024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"554","last_page":"581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8020303249359131},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7077815532684326},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6581405401229858},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3638049364089966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28773242235183716},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13548588752746582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8020303249359131},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7077815532684326},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6581405401229858},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3638049364089966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28773242235183716},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13548588752746582}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-662-53641-4_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-53641-4_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/b09e7275-49c5-483a-90d9-84e1b24bb385","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/b09e7275-49c5-483a-90d9-84e1b24bb385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lindell, Y, Smart, N & Soria-V\u00e1zquez, E 2016, More Efficient Constant-Round Multi-Party Computation from BMR and SHE. in Theory of Cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I. Lecture Notes in Computer Science, vol. 9985, Springer, pp. 554-581. https://doi.org/10.1007/978-3-662-53641-4_21","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/b09e7275-49c5-483a-90d9-84e1b24bb385","is_oa":true,"landing_page_url":"http://eprint.iacr.org/2016/156","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/b09e7275-49c5-483a-90d9-84e1b24bb385","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/b09e7275-49c5-483a-90d9-84e1b24bb385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lindell, Y, Smart, N & Soria-V\u00e1zquez, E 2016, More Efficient Constant-Round Multi-Party Computation from BMR and SHE. in Theory of Cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I. Lecture Notes in Computer Science, vol. 9985, Springer, pp. 554-581. https://doi.org/10.1007/978-3-662-53641-4_21","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2575519571","display_name":null,"funder_award_id":"EP/I03126X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G798744399","display_name":null,"funder_award_id":"EP/N021940/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W104209573","https://openalex.org/W121345474","https://openalex.org/W258132320","https://openalex.org/W1040951941","https://openalex.org/W1458516385","https://openalex.org/W1505629034","https://openalex.org/W1511917306","https://openalex.org/W1521253015","https://openalex.org/W1521730416","https://openalex.org/W1540408657","https://openalex.org/W1560201081","https://openalex.org/W1635361314","https://openalex.org/W1837551011","https://openalex.org/W2019891719","https://openalex.org/W2027471022","https://openalex.org/W2039605106","https://openalex.org/W2064829080","https://openalex.org/W2084682902","https://openalex.org/W2092422002","https://openalex.org/W2119180312","https://openalex.org/W2134340933","https://openalex.org/W2145818182","https://openalex.org/W2149304702","https://openalex.org/W2163481970","https://openalex.org/W2246792095","https://openalex.org/W2294067701","https://openalex.org/W2397066487","https://openalex.org/W2402235285","https://openalex.org/W2477068038","https://openalex.org/W2495293033","https://openalex.org/W2561675875","https://openalex.org/W2990399857","https://openalex.org/W3031847131","https://openalex.org/W3141585064"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":33},{"year":2014,"cited_by_count":146},{"year":2013,"cited_by_count":129}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}