{"id":"https://openalex.org/W1965051705","doi":"https://doi.org/10.1080/09528130903119328","title":"On memoryless provers and insincere verifiers","display_name":"On memoryless provers and insincere verifiers","publication_year":2009,"publication_date":"2009-08-22","ids":{"openalex":"https://openalex.org/W1965051705","doi":"https://doi.org/10.1080/09528130903119328","mag":"1965051705"},"language":"en","primary_location":{"id":"doi:10.1080/09528130903119328","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130903119328","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"},"type":"article","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/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Subramani","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050337397"],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07885541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"3","first_page":"217","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9937000274658203,"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/gas-meter-prover","display_name":"Gas meter prover","score":0.9372150897979736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7693313360214233},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6563737392425537},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5533164739608765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5407426953315735},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5251476764678955},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.4993748664855957},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4832935631275177},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4532528817653656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32767924666404724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20815172791481018},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.1841081976890564},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.114012211561203}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.9372150897979736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7693313360214233},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6563737392425537},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5533164739608765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5407426953315735},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5251476764678955},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.4993748664855957},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4832935631275177},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4532528817653656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32767924666404724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20815172791481018},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.1841081976890564},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.114012211561203},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09528130903119328","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130903119328","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W281989761","https://openalex.org/W1507596338","https://openalex.org/W1512621320","https://openalex.org/W1535634105","https://openalex.org/W1552828154","https://openalex.org/W1589232796","https://openalex.org/W1820801893","https://openalex.org/W1968143987","https://openalex.org/W1982440947","https://openalex.org/W2000472767","https://openalex.org/W2019363670","https://openalex.org/W2019609597","https://openalex.org/W2025304834","https://openalex.org/W2026105979","https://openalex.org/W2031823362","https://openalex.org/W2034506583","https://openalex.org/W2039302045","https://openalex.org/W2040152339","https://openalex.org/W2089112886","https://openalex.org/W2102140349","https://openalex.org/W2103825248","https://openalex.org/W2127489452","https://openalex.org/W2138304862","https://openalex.org/W2150529683","https://openalex.org/W2152198339","https://openalex.org/W2166162093","https://openalex.org/W2185215492","https://openalex.org/W2798566347","https://openalex.org/W4213009134","https://openalex.org/W4231916799","https://openalex.org/W4238893454"],"related_works":["https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W2012694101","https://openalex.org/W2470231588"],"abstract_inverted_index":{"In":[0,133],"this":[1],"article,":[2],"we":[3],"introduce":[4],"a":[5,14,40,56,85,88,118,178,198,205,220,274,285,326],"Prover\u2013Verifier":[6,125],"model":[7,126,281],"for":[8,264,278,287],"analysing":[9],"the":[10,59,76,98,101,104,124,147,152,165,181,185,208,214,226,229,233,236,242,245,271,288,297,302,306,314,321,331,334],"computational":[11],"complexity":[12],"of":[13,16,34,43,61,84,100,163,228,238,241,273,290,316,328,330],"class":[15,33],"constraint":[17,24,46,68,116],"satisfaction":[18,25],"problems":[19,26],"(CSPs)":[20],"termed":[21],"boolean":[22],"binary":[23],"(BBCSPs).":[27],"BBCSPs":[28],"represent":[29],"an":[30,249,339],"extremely":[31,265],"general":[32],"CSPs":[35],"and":[36,50,139,168,210,235,258],"find":[37],"applications":[38,312],"in":[39,55,70,94,97,108,123,158,170,190,201,213,217,295,313],"wide":[41],"variety":[42],"domains":[44],"including":[45],"programming,":[47],"puzzle":[48],"solving":[49],"program":[51],"testing.":[52],"The":[53,120,149],"constraints":[54,73],"BBCSP":[57,86],"permit":[58],"combination":[60,227],"multiple":[62],"theories":[63],"as":[64,252,284],"opposed":[65],"to":[66,75,146,176,204,219,324],"traditional":[67],"systems":[69],"which":[71],"all":[72,164],"belong":[74],"same":[77,215],"theory.":[78],"We":[79,223],"establish":[80],"that":[81,92,109,159,171,225,296],"each":[82],"instance":[83,336],"admits":[87],"coin-flipping":[89],"Turing":[90],"machine":[91,292],"halts":[93],"time":[95],"polynomial":[96],"size":[99],"input.":[102],"Furthermore,":[103],"algorithm":[105,277,318,332],"is":[106,127,155,161,323],"oblivious":[107],"it":[110,135,140,160,172,194],"never":[111],"sees":[112],"more":[113],"than":[114],"one":[115,202],"at":[117],"time.":[119],"prover,":[121],"P,":[122],"endowed":[128],"with":[129],"very":[130],"limited":[131],"powers.":[132],"particular,":[134],"has":[136],"no":[137],"memory":[138],"can":[141],"only":[142],"pose":[143],"restricted":[144],"queries":[145],"verifier.":[148,307],"verifier,":[150,243],"on":[151,180,333],"other":[153],"hand,":[154],"both":[156],"omniscient":[157],"cognisant":[162],"problem":[166],"details":[167],"insincere":[169],"does":[173],"not":[174],"have":[175],"decide":[177],"priori":[179],"intended":[182],"proof.":[183],"However,":[184],"verifier":[186],"must":[187],"stay":[188],"consistent":[189],"its":[191],"responses,":[192],"i.e.":[193],"cannot":[195],"rule":[196,212],"out":[197],"certain":[199],"possibility":[200,216],"response":[203,218],"query":[206],"from":[207],"prover":[209,234,298],"then":[211],"subsequent":[221],"query.":[222],"note":[224],"resources":[230,246],"required":[231,247],"by":[232,248,305,337],"type":[237],"certificate":[239],"demanded":[240],"determine":[244],"algorithm.":[250],"Inasmuch":[251],"our":[253,259,268,309],"provers":[254],"will":[255,261],"be":[256,262],"memoryless":[257],"verifiers":[260],"asked":[263],"simple":[266],"certificates,":[267],"work":[269,310],"establishes":[270],"existence":[272],"simple,":[275],"randomised":[276],"BBCSPs.":[279],"Our":[280],"itself":[282],"serves":[283],"basis":[286],"design":[289],"zero-knowledge":[291],"learning":[293,301],"algorithms":[294],"ends":[299],"up":[300],"proof":[303,327],"desired":[304],"Likewise,":[308],"finds":[311],"domain":[315],"certifying":[317],"design,":[319],"wherein":[320],"goal":[322],"provide":[325],"correctness":[329],"input":[335],"providing":[338],"easily":[340],"checkable":[341],"certificate.":[342]},"counts_by_year":[],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}