{"id":"https://openalex.org/W2496543269","doi":"https://doi.org/10.1007/978-3-662-49896-5_11","title":"On the Size of Pairing-Based Non-interactive Arguments","display_name":"On the Size of Pairing-Based Non-interactive Arguments","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2496543269","doi":"https://doi.org/10.1007/978-3-662-49896-5_11","mag":"2496543269"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-49896-5_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49896-5_11","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080460372","display_name":"Jens Groth","orcid":"https://orcid.org/0000-0001-6291-7832"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jens Groth","raw_affiliation_strings":["University College London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080460372"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":23.0515,"has_fulltext":false,"cited_by_count":1057,"citation_normalized_percentile":{"value":0.99715968,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9912999868392944,"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"}},{"id":"https://openalex.org/T10270","display_name":"Blockchain Technology Applications and Security","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.9148280620574951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6866028308868408},{"id":"https://openalex.org/keywords/pairing","display_name":"Pairing","score":0.6489045023918152},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5637103319168091},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.5472939610481262},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5463935732841492},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5288126468658447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5206262469291687},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5182161927223206},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48953017592430115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4253707230091095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3153042793273926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24029743671417236}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.9148280620574951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6866028308868408},{"id":"https://openalex.org/C14103023","wikidata":"https://www.wikidata.org/wiki/Q11681459","display_name":"Pairing","level":3,"score":0.6489045023918152},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5637103319168091},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.5472939610481262},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5463935732841492},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5288126468658447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5206262469291687},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5182161927223206},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48953017592430115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4253707230091095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3153042793273926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24029743671417236},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C54101563","wikidata":"https://www.wikidata.org/wiki/Q124131","display_name":"Superconductivity","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-662-49896-5_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49896-5_11","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:eprints.ucl.ac.uk.OAI2:1501198","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1501198/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   Presented at: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Vienna, AUSTRIA. (2016)     ","raw_type":"Conference item"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1501201","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/1501201/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In: Fischlin, M and Coron, J-S, (eds.) EUROCRYPT 2016: Advances in Cryptology \u2013 EUROCRYPT 2016.  (pp. pp. 305-326).  Springer International Publishing AG (2016)     ","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6942110655","display_name":null,"funder_award_id":"EP/J009520/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":50,"referenced_works":["https://openalex.org/W4180724","https://openalex.org/W104938420","https://openalex.org/W112550803","https://openalex.org/W121268239","https://openalex.org/W198492818","https://openalex.org/W825911753","https://openalex.org/W945570858","https://openalex.org/W1424543055","https://openalex.org/W1481735483","https://openalex.org/W1522706628","https://openalex.org/W1538440442","https://openalex.org/W1540469777","https://openalex.org/W1541538376","https://openalex.org/W1548963432","https://openalex.org/W1552851303","https://openalex.org/W1553968376","https://openalex.org/W1563556756","https://openalex.org/W1569083856","https://openalex.org/W1607818785","https://openalex.org/W1788452017","https://openalex.org/W1836725053","https://openalex.org/W1890128745","https://openalex.org/W1969892674","https://openalex.org/W1970606468","https://openalex.org/W1970808997","https://openalex.org/W1976646754","https://openalex.org/W2013686252","https://openalex.org/W2018746447","https://openalex.org/W2026892462","https://openalex.org/W2043007983","https://openalex.org/W2067047774","https://openalex.org/W2067596507","https://openalex.org/W2070717008","https://openalex.org/W2079913403","https://openalex.org/W2089537103","https://openalex.org/W2090853363","https://openalex.org/W2108240589","https://openalex.org/W2126664878","https://openalex.org/W2131235219","https://openalex.org/W2141375261","https://openalex.org/W2144238522","https://openalex.org/W2166670067","https://openalex.org/W2168811559","https://openalex.org/W2171337840","https://openalex.org/W2182494219","https://openalex.org/W2188776605","https://openalex.org/W2239708745","https://openalex.org/W2489890856","https://openalex.org/W2529173666","https://openalex.org/W3028607946"],"related_works":["https://openalex.org/W2149634854","https://openalex.org/W4400642643","https://openalex.org/W4402530505","https://openalex.org/W2562305209","https://openalex.org/W3030245161","https://openalex.org/W2519290549","https://openalex.org/W2096571200","https://openalex.org/W4389777186","https://openalex.org/W2809883875","https://openalex.org/W3030523870"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":81},{"year":2025,"cited_by_count":234},{"year":2024,"cited_by_count":194},{"year":2023,"cited_by_count":169},{"year":2022,"cited_by_count":135},{"year":2021,"cited_by_count":109},{"year":2020,"cited_by_count":67},{"year":2019,"cited_by_count":32},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-29T09:21:14.243279","created_date":"2025-10-10T00:00:00"}