{"id":"https://openalex.org/W7167635059","doi":"https://doi.org/10.48550/arxiv.2607.02847","title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","display_name":"ShannonProver: Towards Automating Formal Cryptographic Proofs","publication_year":2026,"publication_date":"2026-07-03","ids":{"openalex":"https://openalex.org/W7167635059","doi":"https://doi.org/10.48550/arxiv.2607.02847"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.02847","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02847","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,"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":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.02847","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140164348","display_name":"Yiping Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Yiping","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140162288","display_name":"Yu-Lin Tsai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tsai, Yu-Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011760914","display_name":"Mayank Rathee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rathee, Mayank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087899680","display_name":"Deevashwer Rathee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rathee, Deevashwer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140189844","display_name":"Fran\u00e7ois Dupressoir","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dupressoir, Fran\u00e7ois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033447950","display_name":"Pierre-Yves Strub","orcid":"https://orcid.org/0000-0002-8196-7875"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Strub, Pierre-Yves","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136211374","display_name":"Raluca Ada Popa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Popa, Raluca Ada","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11504","display_name":"Advanced Authentication Protocols Security","score":0.19660000503063202,"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"}},"topics":[{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.19660000503063202,"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/T11424","display_name":"Security and Verification in Computing","score":0.1746000051498413,"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.1128000020980835,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8565999865531921},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6866999864578247},{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.6367999911308289},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.6069999933242798},{"id":"https://openalex.org/keywords/cryptographic-protocol","display_name":"Cryptographic protocol","score":0.5570999979972839},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.520799994468689},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.5098999738693237},{"id":"https://openalex.org/keywords/scripting-language","display_name":"Scripting language","score":0.4900999963283539},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.44179999828338623}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8565999865531921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7696999907493591},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6866999864578247},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.6367999911308289},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.6069999933242798},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.5570999979972839},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.520799994468689},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5116000175476074},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.5098999738693237},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.4900999963283539},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.44179999828338623},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.43369999527931213},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38960000872612},{"id":"https://openalex.org/C118463975","wikidata":"https://www.wikidata.org/wiki/Q220849","display_name":"Digital signature","level":3,"score":0.384799987077713},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3433000147342682},{"id":"https://openalex.org/C111219384","wikidata":"https://www.wikidata.org/wiki/Q6954384","display_name":"NIST","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C188087704","wikidata":"https://www.wikidata.org/wiki/Q369577","display_name":"Standardization","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.27059999108314514},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C17566778","wikidata":"https://www.wikidata.org/wiki/Q467602","display_name":"Proofs of Fermat's little theorem","level":5,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.02847","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02847","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.02847","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02847","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,"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":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4027135968208313,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cryptographic":[0],"proofs":[1,18,112],"are":[2],"produced":[3],"at":[4],"a":[5,20,38,75,82,107,136,170],"scale":[6],"that":[7,138,147],"increasingly":[8],"exceeds":[9],"the":[10,43,71,78,85,93,179],"community's":[11],"ability":[12],"to":[13,200],"verify":[14],"them":[15],"manually.":[16],"Machine-checked":[17],"offer":[19],"path":[21,171],"toward":[22,172],"scalable":[23],"proof":[24,28,32,45,52,90,98,155],"verification,":[25],"but":[26],"writing":[27],"scripts":[29,99],"for":[30,65,100,157],"expressive":[31],"assistants":[33],"such":[34,125,160],"as":[35,126,161,176],"EasyCrypt":[36,97],"remains":[37],"major":[39],"bottleneck:":[40],"even":[41],"when":[42],"high-level":[44],"plan":[46],"is":[47],"known,":[48],"converting":[49],"it":[50],"into":[51,88],"tactics":[53],"requires":[54],"substantial":[55,151],"reasoning":[56],"effort.":[57],"This":[58],"paper":[59],"presents":[60],"ShannonProver,":[61],"an":[62],"agentic":[63],"framework":[64],"automating":[66],"cryptographic":[67,111,154,174],"proofs.":[68],"ShannonProver":[69,105,148],"targets":[70],"setting":[72],"in":[73,113],"which":[74],"cryptographer":[76],"provides":[77],"security":[79],"model":[80],"and":[81,122,129,163,194],"decomposition":[83],"of":[84,109,153],"target":[86],"theorem":[87],"lemma-level":[89],"obligations,":[91],"while":[92],"system":[94],"automatically":[95],"constructs":[96],"those":[101],"obligations.":[102],"We":[103,145],"evaluate":[104],"on":[106,187],"dataset":[108,116],"formal":[110],"EasyCrypt.":[114],"The":[115],"spans":[117],"textbook":[118],"primitives,":[119],"deployed":[120],"protocols,":[121],"standardization":[123],"efforts":[124],"NIST":[127],"proposals,":[128],"includes":[130],"expert":[131],"case":[132,158],"studies":[133,159],"drawn":[134],"from":[135,198],"corpus":[137],"has":[139],"not":[140],"previously":[141],"been":[142],"available":[143],"online.":[144],"show":[146],"can":[149,183],"automate":[150,178],"portions":[152],"engineering":[156],"ChaChaPoly1305":[162],"MEE-CBC.":[164],"More":[165],"broadly,":[166],"this":[167],"work":[168],"suggests":[169],"accelerating":[173],"research:":[175],"agents":[177],"proof-engineering":[180],"burden,":[181],"cryptographers":[182],"iterate":[184],"more":[185],"quickly":[186],"new":[188],"constructions,":[189],"obtain":[190],"machine-checked":[191],"assurance":[192],"earlier,":[193],"bring":[195],"trustworthy":[196],"protocols":[197],"design":[199],"deployment":[201],"faster.":[202]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-08T00:00:00"}