{"id":"https://openalex.org/W2039487342","doi":"https://doi.org/10.1145/2422436.2422471","title":"Streaming computations with a loquacious prover","display_name":"Streaming computations with a loquacious prover","publication_year":2013,"publication_date":"2013-01-03","ids":{"openalex":"https://openalex.org/W2039487342","doi":"https://doi.org/10.1145/2422436.2422471","mag":"2039487342"},"language":"en","primary_location":{"id":"doi:10.1145/2422436.2422471","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"institutions":[{"id":"https://openalex.org/I115455960","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115455960"]},{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Hartmut Klauck","raw_affiliation_strings":["Nanyang Technological University and Centre for Quantum Technologies, Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University and Centre for Quantum Technologies, Singapore, Singapore","institution_ids":["https://openalex.org/I115455960","https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070546308","display_name":"Ved Prakash","orcid":"https://orcid.org/0000-0001-8300-2340"},"institutions":[{"id":"https://openalex.org/I115455960","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115455960"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Ved Prakash","raw_affiliation_strings":["Centre for Quantum Technologies, Singapore, Singapore","Centre for Quantum Technologies, Singapore, SINGAPORE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Quantum Technologies, Singapore, Singapore","institution_ids":["https://openalex.org/I115455960"]},{"raw_affiliation_string":"Centre for Quantum Technologies, Singapore, SINGAPORE","institution_ids":["https://openalex.org/I115455960"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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.9998000264167786,"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.9998000264167786,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.9810389280319214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7557508945465088},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5562611818313599},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4939783215522766},{"id":"https://openalex.org/keywords/data-stream","display_name":"Data stream","score":0.49184346199035645},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.48587125539779663},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.45422983169555664},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.43832987546920776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40191060304641724},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23007622361183167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18049356341362},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1309717297554016},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.0939657986164093}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.9810389280319214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7557508945465088},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5562611818313599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4939783215522766},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.49184346199035645},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.48587125539779663},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.45422983169555664},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.43832987546920776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40191060304641724},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23007622361183167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18049356341362},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1309717297554016},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0939657986164093},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2422436.2422471","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W47137029","https://openalex.org/W1527197079","https://openalex.org/W1686241726","https://openalex.org/W1965972569","https://openalex.org/W1984477611","https://openalex.org/W1985061810","https://openalex.org/W1995484833","https://openalex.org/W2018543684","https://openalex.org/W2032626654","https://openalex.org/W2049982182","https://openalex.org/W2051391952","https://openalex.org/W2059867647","https://openalex.org/W2066885472","https://openalex.org/W2068462176","https://openalex.org/W2074139744","https://openalex.org/W2080745194","https://openalex.org/W2089797683","https://openalex.org/W2132588842","https://openalex.org/W2134677596","https://openalex.org/W2138736975","https://openalex.org/W2143594377","https://openalex.org/W2146099890","https://openalex.org/W2148957455","https://openalex.org/W2152489475","https://openalex.org/W2166789519","https://openalex.org/W2340787257","https://openalex.org/W2809548040","https://openalex.org/W2949292204","https://openalex.org/W2950181908","https://openalex.org/W4247080677"],"related_works":["https://openalex.org/W2151433956","https://openalex.org/W2564184999","https://openalex.org/W2915124127","https://openalex.org/W4386302629","https://openalex.org/W2039487342","https://openalex.org/W4313679712","https://openalex.org/W2365282734","https://openalex.org/W2162506849","https://openalex.org/W4281390594","https://openalex.org/W4206945301"],"abstract_inverted_index":{"We":[0,110],"define":[1],"a":[2,11,18,83,122,208,218],"new":[3],"model":[4,38,123,165],"of":[5,34,107,133,144,163,207,236,245,247],"data":[6,36,58,146],"streaming":[7,37],"algorithms":[8,188,216],"that":[9,86,112,124],"employ":[10],"prover/helper":[12],"to":[13,88,94,139,185,232,240,257],"outsource":[14],"difficult":[15],"computations":[16],"in":[17,40,253],"verifiable":[19],"way.":[20],"While":[21],"for":[22,150,189,202],"the":[23,25,35,42,52,69,73,76,80,92,95,99,105,108,114,127,131,137,140,145,160,164,172,180,192,199,205,237,248,259],"verifier":[24,96,141,157],"usual":[26],"time":[27],"(per":[28],"symbol":[29,143],"read)":[30],"and":[31,75,120,156,201,227],"space":[32],"constraints":[33],"are":[39,176],"place,":[41],"prover":[43,74,93,138,155],"has":[44,87,102,174],"unbounded":[45],"space.":[46],"Both":[47],"parties":[48],"cannot":[49],"look":[50],"into":[51],"future":[53],"(i.e.,":[54],"do":[55],"not":[56,177],"know":[57],"arriving":[59],"later).":[60],"Previous":[61],"work":[62],"on":[63],"such":[64],"models":[65],"either":[66],"severely":[67,117],"restricted":[68],"total":[70,115],"communication":[71,116,128,134,153,181],"between":[72,154],"verifier,":[77],"or":[78,212],"extended":[79],"computation":[81,106],"by":[82],"long":[84,168],"annotation":[85],"be":[89],"streamed":[90],"from":[91,136],"offline":[97],"after":[98,171],"original":[100],"stream":[101,173,238],"ended,":[103],"delaying":[104],"result.":[109],"argue":[111],"restricting":[113],"is":[118,210,256],"unnatural":[119],"investigate":[121],"only":[125],"bounds":[126],"overhead,":[129],"i.e.,":[130],"amount":[132],"sent":[135,170],"per":[142],"stream.":[147,250],"This":[148],"allows":[149,183],"vastly":[151],"more":[152],"while":[158],"maintaining":[159],"online":[161],"nature":[162],"(in":[166],"particular":[167],"annotations":[169],"ended":[175],"allowed).":[178],"Relaxing":[179],"requirement":[182],"us":[184],"find":[186],"simple":[187],"problems":[190],"like":[191],"Longest":[193],"Increasing":[194],"Subsequence":[195],"Problem":[196],"(LIS),":[197],"finding":[198],"Median,":[200],"deciding":[203],"whether":[204],"rank":[206],"matrix":[209],"full":[211],"not.":[213],"All":[214],"our":[215],"have":[217],"similar":[219],"structure":[220],"with":[221],"phases":[222,261],"whose":[223],"length":[224],"shrinks":[225],"geometrically,":[226],"phase":[228,241],"i":[229],"being":[230],"used":[231],"verify":[233],"certain":[234],"properties":[235],"up":[239],"i-1":[242],"using":[243],"re-streaming":[244],"parts":[246],"previous":[249],"The":[251],"challenge":[252],"each":[254],"case":[255],"tie":[258],"different":[260],"together.":[262]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}