{"id":"https://openalex.org/W2964072500","doi":null,"title":"On the implausibility of classical client blind quantum computing","display_name":"On the implausibility of classical client blind quantum computing","publication_year":2017,"publication_date":"2017-09-22","ids":{"openalex":"https://openalex.org/W2964072500","mag":"2964072500"},"language":"en","primary_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/4ba24f42-5add-4636-8970-c2db7178a56f","doi":null,"is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/4ba24f42-5add-4636-8970-c2db7178a56f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aaronson, S, Cojocaru, A, Gheorghiu, A & Kashefi, E 2017, 'On the implausibility of classical client blind quantum computing', Paper presented at 7th International Conference on Quantum Cryptography, Cambridge, United Kingdom, 18/09/17 - 22/09/17.","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/4ba24f42-5add-4636-8970-c2db7178a56f","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020769134","display_name":"Scott Aaronson","orcid":"https://orcid.org/0000-0003-1333-4045","observed_orcids":["https://orcid.org/0000-0003-1333-4045"]},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Scott Aaronson","raw_affiliation_strings":["Laboratory for the Foundations of Computer Science [Edinburgh]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for the Foundations of Computer Science [Edinburgh]","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025876194","display_name":"Alexandru Cojocaru","orcid":"https://orcid.org/0000-0003-2710-1170","observed_orcids":["https://orcid.org/0000-0003-2710-1170"]},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexandru Cojocaru","raw_affiliation_strings":["Laboratory for the Foundations of Computer Science [Edinburgh]"],"raw_orcid":"https://orcid.org/0000-0003-2710-1170","affiliations":[{"raw_affiliation_string":"Laboratory for the Foundations of Computer Science [Edinburgh]","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034927946","display_name":"Alexandru Gheorghiu","orcid":"https://orcid.org/0000-0001-6225-7168","observed_orcids":["https://orcid.org/0000-0001-6225-7168"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandru Gheorghiu","raw_affiliation_strings":["School of Informatics"],"raw_orcid":"https://orcid.org/0000-0001-6225-7168","affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052107957","display_name":"Elham Kashefi","orcid":"https://orcid.org/0000-0001-6280-9604","observed_orcids":["https://orcid.org/0000-0001-6280-9604"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elham Kashefi","raw_affiliation_strings":["School of Informatics"],"raw_orcid":"https://orcid.org/0000-0001-6280-9604","affiliations":[{"raw_affiliation_string":"School of Informatics","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8732,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79853653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.8838000297546387,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.8838000297546387,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.09809999912977219,"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/T10237","display_name":"Cryptography and Data Security","score":0.014100000262260437,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/blind-quantum-computation","display_name":"blind quantum computation","score":0.8360000252723694},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"information-theoretic security","score":0.8880000114440918},{"id":"https://openalex.org/keywords/boson-sampling","display_name":"boson sampling","score":0.6919999718666077},{"id":"https://openalex.org/keywords/polynomial-hierarchy-collapse","display_name":"polynomial hierarchy collapse","score":0.7799999713897705},{"id":"https://openalex.org/keywords/quantum-cryptography","display_name":"quantum cryptography","score":0.32499998807907104},{"id":"https://openalex.org/keywords/quantum-verification","display_name":"quantum verification","score":0.3490000069141388},{"id":"https://openalex.org/keywords/complexity-class-separation","display_name":"complexity class separation","score":0.6179999709129333}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.7035560011863708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6966208219528198},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6029443144798279},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5679576396942139},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.479979008436203},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.4687003791332245},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.446785569190979},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.13898658752441406},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13801982998847961},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13241666555404663},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.ed.ac.uk:openaire/4ba24f42-5add-4636-8970-c2db7178a56f","doi":null,"is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/4ba24f42-5add-4636-8970-c2db7178a56f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aaronson, S, Cojocaru, A, Gheorghiu, A & Kashefi, E 2017, 'On the implausibility of classical client blind quantum computing', Paper presented at 7th International Conference on Quantum Cryptography, Cambridge, United Kingdom, 18/09/17 - 22/09/17.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2964072500","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1704.08482.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/4ba24f42-5add-4636-8970-c2db7178a56f","doi":null,"is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/4ba24f42-5add-4636-8970-c2db7178a56f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aaronson, S, Cojocaru, A, Gheorghiu, A & Kashefi, E 2017, 'On the implausibility of classical client blind quantum computing', Paper presented at 7th International Conference on Quantum Cryptography, Cambridge, United Kingdom, 18/09/17 - 22/09/17.","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3404966273","display_name":null,"funder_award_id":"N003829/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6452282401","display_name":"Verification of Quantum Technology","funder_award_id":"EP/N003829/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306078","display_name":"U.S. Department of Defense","ror":"https://ror.org/0447fe631"},{"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":0,"referenced_works":[],"related_works":["https://openalex.org/W2971219139","https://openalex.org/W2915778761","https://openalex.org/W2552273708","https://openalex.org/W2924625508","https://openalex.org/W3100206777","https://openalex.org/W2340527262","https://openalex.org/W3122837053","https://openalex.org/W2894938627","https://openalex.org/W2724637409","https://openalex.org/W1425827848"],"abstract_inverted_index":{"Suppose":[0],"a":[1,29,167,193,201,216,231,261],"large":[2],"scale":[3],"quantum":[4,15,70,86,110,132,157,183,197,262],"computer":[5],"becomes":[6],"available":[7],"over":[8],"the":[9,36,41,60,67,94,170,209,245,251,257,268],"Internet.":[10],"Could":[11],"we":[12,55,80,119,138,149,248],"delegate":[13],"universal":[14,131],"computations":[16,133],"to":[17,166,244],"this":[18,53],"server,":[19,27],"using":[20],"only":[21],"classical":[22,127,190,238,265],"communication":[23,71,184],"between":[24,72,142],"client":[25,73],"and":[26,74,185],"in":[28],"way":[30],"that":[31,59,82,107,151,213],"is":[32,62,76,88,104,233],"information-theoretically":[33,84,125],"blind":[34,85,196],"(i.e.,":[35],"server":[37,75],"learns":[38],"nothing":[39],"about":[40],"input":[42],"apart":[43],"from":[44],"its":[45],"size,":[46],"with":[47,66,93,267],"no":[48,234],"cryptographic":[49,97],"assumptions":[50,98],"required)?":[51],"In":[52,116],"paper":[54],"give":[56,200],"strong":[57],"indications":[58],"answer":[61],"no.":[63],"This":[64,218],"contrasts":[65,92],"situation":[68],"where":[69,79,96],"allowed":[77],"---":[78],"know":[81],"such":[83,145,153,160,215,230],"computation":[87,263],"possible.":[89],"It":[90],"also":[91],"case":[95],"are":[99,109],"allowed:":[100],"there":[101,108,123],"again,":[102],"it":[103],"now":[105],"known":[106],"analogues":[111],"of":[112,169,182,189,195,211,253,259],"fully":[113],"homomorphic":[114],"encryption.":[115],"more":[117,235],"detail,":[118],"observe":[120],"that,":[121,225],"if":[122],"exist":[124],"secure":[126],"schemes":[128,154,177,239],"for":[129,155,240,256],"performing":[130],"on":[134,208,250],"encrypted":[135],"data,":[136],"then":[137,174,221],"get":[139],"unlikely":[140],"containments":[141],"complexity":[143,202,228],"classes,":[144],"as":[146,161],"BQP\u2282NP/poly.":[147],"Moreover,":[148],"prove":[150],"having":[152],"delegating":[156,241],"sampling":[158],"problems,":[159],"Boson":[162],"Sampling,":[163],"would":[164],"lead":[165],"collapse":[168],"polynomial":[171],"hierarchy.":[172],"We":[173,199],"consider":[175],"encryption":[176],"which":[178],"allow":[179],"one":[180],"round":[181],"polynomially":[186],"many":[187],"rounds":[188],"communication,":[191],"yielding":[192],"generalization":[194],"computation.":[198],"theoretic":[203],"upper":[204,219],"bound,":[205],"namely":[206],"QCMA/qpoly\u2229coQCMA/qpoly,":[207],"types":[210],"functions":[212],"admit":[214],"scheme.":[217],"bound":[220],"lets":[222],"us":[223],"show":[224],"under":[226],"plausible":[227],"assumptions,":[229],"protocol":[232],"useful":[236],"than":[237],"NP-hard":[242],"problems":[243],"server.":[246,269],"Lastly,":[247],"comment":[249],"implications":[252],"these":[254],"results":[255],"prospect":[258],"verifying":[260],"through":[264],"interaction":[266]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2019-07-30T00:00:00"}