{"id":"https://openalex.org/W1801771305","doi":"https://doi.org/10.1007/3-540-44598-6_27","title":"Improved Non-committing Encryption Schemes Based on a General Complexity Assumption","display_name":"Improved Non-committing Encryption Schemes Based on a General Complexity Assumption","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1801771305","doi":"https://doi.org/10.1007/3-540-44598-6_27","mag":"1801771305"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44598-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44598-6_27","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/A5079826922","display_name":"Ivan Damg\u00e5rd","orcid":"https://orcid.org/0009-0003-6164-0896"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Ivan Damg\u00e5rd","raw_affiliation_strings":["BRICS Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Arhus C, Denmark"],"affiliations":[{"raw_affiliation_string":"BRICS Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Arhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067885668","display_name":"Jesper Buus Nielsen","orcid":"https://orcid.org/0000-0002-7074-0683"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jesper Buus Nielsen","raw_affiliation_strings":["BRICS Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Arhus C, Denmark"],"affiliations":[{"raw_affiliation_string":"BRICS Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Arhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079826922"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.2823,"has_fulltext":false,"cited_by_count":178,"citation_normalized_percentile":{"value":0.97603658,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"432","last_page":"450"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9968000054359436,"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.9930999875068665,"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.7710108757019043},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.7017336487770081},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.6841220259666443},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5495643615722656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5315660834312439},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5308310389518738},{"id":"https://openalex.org/keywords/probabilistic-encryption","display_name":"Probabilistic encryption","score":0.483851820230484},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4641135334968567},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4323309063911438},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.2963156998157501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20483183860778809}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7710108757019043},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.7017336487770081},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.6841220259666443},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5495643615722656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5315660834312439},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5308310389518738},{"id":"https://openalex.org/C54569210","wikidata":"https://www.wikidata.org/wiki/Q7246854","display_name":"Probabilistic encryption","level":3,"score":0.483851820230484},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4641135334968567},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4323309063911438},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.2963156998157501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20483183860778809},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-44598-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44598-6_27","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:pure.atira.dk:publications/dd781d30-8d32-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/dd781d30-8d32-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I B & Nielsen, J B 2000, Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. in M Bellare (ed.), Advances in Cryptology - CRYPTO 2000 : 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20-24, 2000 Proceedings. Springer, Lecture Notes in Computer Science, vol. 1880, pp. 432-450, Annual International Cryptology Conference, Santa Barbara, CA, United States, 20/08/2000. https://doi.org/10.1007/3-540-44598-6_27","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W59079490","https://openalex.org/W147290027","https://openalex.org/W296683941","https://openalex.org/W1489286008","https://openalex.org/W1512229420","https://openalex.org/W1523616062","https://openalex.org/W1540442590","https://openalex.org/W1569930334","https://openalex.org/W1584560347","https://openalex.org/W1971297422","https://openalex.org/W1997859100","https://openalex.org/W2006453614","https://openalex.org/W2027471022","https://openalex.org/W2061106457","https://openalex.org/W2079631449","https://openalex.org/W2080911030","https://openalex.org/W2092422002","https://openalex.org/W2096430557","https://openalex.org/W2096571200","https://openalex.org/W2107324709","https://openalex.org/W2121423622","https://openalex.org/W2143490740","https://openalex.org/W2148373594","https://openalex.org/W2149634854","https://openalex.org/W2728668775","https://openalex.org/W2949264753","https://openalex.org/W2990399857","https://openalex.org/W4234113709"],"related_works":["https://openalex.org/W4361852638","https://openalex.org/W3004922236","https://openalex.org/W1988224692","https://openalex.org/W2030024189","https://openalex.org/W2553675779","https://openalex.org/W2392000646","https://openalex.org/W2127067832","https://openalex.org/W4250199380","https://openalex.org/W4239572594","https://openalex.org/W2054159849"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}