{"paper_id":"2407.13776","title":"Offline Digital Euro: a Minimum Viable CBDC using Groth-Sahai proofs","authors":["Leon Kempen","Johan Pouwelse"],"paper_date":"2024-07-01","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2407.13776v1","page_url":"https://thequant.space/flowcharts/offline-digital-euro-a-minimum-viable-cbdc-using-groth-saha/","scores":{"empirical_rigor":3,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a payment protocol for the digital euro that supports fully offline, privacy‑preserving payments and provides retrospective fraud detection.","quote":"This thesis proposes a design for the payment protocol of the digital euro that supports fully offline payments, whilst protecting the users’ privacy. More specifically our contributions are as follows: 1) We propose a payment protocol that supports fully offline privacy-preserving payments and could be used by the ECB as implementation for the digital euro.","summary":"Current digital payment solutions are fragile and offer less privacy than traditional cash. Their critical dependency on an online service used to perform and validate transactions makes them void if this service is unreachable. Moreover, no transaction can be executed during server malfunctions or…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The Discrete Logarithm Problem is hard in the chosen cyclic group.","type":"other","stated":"explicit","quote":"These assumptions are the Discrete logarithm problem and the Computational Diffie-Hellman assumption.","support":"full"},{"assumption":"The Computational Diffie‑Hellman assumption holds in the chosen cyclic group.","type":"other","stated":"explicit","quote":"The Computational Diffie-Hellman assumption states that given a finite cyclic group G, generator ⟨g⟩of G, ga and gb, it is computationally hard to compute gab, without knowing the values of a and b.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The protocol offers complete privacy during transactions using zero‑knowledge proofs.","kind":"theoretical","quote":"The protocol offers complete privacy during transactions using zero-knowledge proofs. Furthermore, transactions can be executed offline without third parties and retroactive double-spending detection is facilitated.","support":"full"},{"finding":"A working initial implementation demonstrates the protocol’s usability and functionality.","kind":"theoretical","quote":"The protocol has a working initial implementation showcasing its usability and demonstrating functionality. More specifically our contributions are as follows: 1) We propose a payment protocol that supports fully offline privacy-preserving payments and could be used by the ECB as implementation for the digital euro.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":5,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/LeonKempen/trustchain-superapp","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:56:26Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}