[{"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412), and by the Advanced Research and Invention Agency under the Safeguarded AI programme (MSAI-PR01-P047).","OA_type":"hybrid","ec_funded":1,"article_processing_charge":"No","type":"conference","department":[{"_id":"ToHe"}],"volume":16557,"OA_place":"publisher","page":"214-233","date_created":"2026-06-14T22:01:44Z","citation":{"short":"M. Chalupa, T.A. Henzinger, N.E. Sarac, E. Yu, in:, 27th International Symposium on Formal Methods, Springer Nature, 2026, pp. 214–233.","ieee":"M. Chalupa, T. A. Henzinger, N. E. Sarac, and E. Yu, “Quantitative monitoring of Signal First-Order logic,” in <i>27th International Symposium on Formal Methods</i>, Tokyo, Japan, 2026, vol. 16557, pp. 214–233.","ista":"Chalupa M, Henzinger TA, Sarac NE, Yu E. 2026. Quantitative monitoring of Signal First-Order logic. 27th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 16557, 214–233.","ama":"Chalupa M, Henzinger TA, Sarac NE, Yu E. Quantitative monitoring of Signal First-Order logic. In: <i>27th International Symposium on Formal Methods</i>. Vol 16557. Springer Nature; 2026:214-233. doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>","chicago":"Chalupa, Marek, Thomas A Henzinger, Naci E Sarac, and Emily Yu. “Quantitative Monitoring of Signal First-Order Logic.” In <i>27th International Symposium on Formal Methods</i>, 16557:214–33. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>.","apa":"Chalupa, M., Henzinger, T. A., Sarac, N. E., &#38; Yu, E. (2026). Quantitative monitoring of Signal First-Order logic. In <i>27th International Symposium on Formal Methods</i> (Vol. 16557, pp. 214–233). Tokyo, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>","mla":"Chalupa, Marek, et al. “Quantitative Monitoring of Signal First-Order Logic.” <i>27th International Symposium on Formal Methods</i>, vol. 16557, Springer Nature, 2026, pp. 214–33, doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>."},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Signal first-order logic","Robustness-based quantitative semantics","Online runtime monitoring"],"conference":{"location":"Tokyo, Japan","end_date":"2026-05-22","name":"FM: Formal Methods","start_date":"2026-05-18"},"file":[{"file_size":849237,"file_id":"22113","date_created":"2026-06-22T08:18:41Z","content_type":"application/pdf","success":1,"checksum":"7055199ecb985e9e2e272f4988827067","access_level":"open_access","creator":"dernst","relation":"main_file","file_name":"2026_LNCS_Chalupa.pdf","date_updated":"2026-06-22T08:18:41Z"}],"external_id":{"arxiv":["2603.00728"]},"fulldoi":"https://doi.org/10.1007/978-3-032-26220-2_11","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"22006","publication_identifier":{"isbn":["9783032262196"],"issn":["0302-9743"],"eissn":["1611-3349"]},"day":"18","has_accepted_license":"1","doi":"10.1007/978-3-032-26220-2_11","arxiv":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"publication_status":"published","intvolume":"     16557","date_published":"2026-05-18T00:00:00Z","oa":1,"status":"public","date_updated":"2026-06-22T08:21:09Z","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"},{"last_name":"Yu","full_name":"Yu, Zhengqi","orcid":"0000-0002-4993-773X","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi"}],"month":"05","title":"Quantitative monitoring of Signal First-Order logic","scopus_import":"1","file_date_updated":"2026-06-22T08:18:41Z","oa_version":"Published Version","abstract":[{"text":"Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support. We provide the first robustness-based quantitative semantics for SFO, enabling the expression and evaluation of rich real-time properties beyond the scope of existing formalisms such as Signal Temporal Logic. To enable online monitoring, we identify a past-time fragment of SFO and give a pastification procedure that transforms bounded-response SFO formulas into equisatisfiable formulas in this fragment. We then develop an efficient runtime monitoring algorithm for this past-time fragment and evaluate its performance on a set of benchmarks, demonstrating the practicality and effectiveness of our approach. To the best of our knowledge, this is the first publicly available prototype for online quantitative monitoring of full SFO.","lang":"eng"}],"ddc":["000"],"year":"2026","publication":"27th International Symposium on Formal Methods","das_tickbox":"0"},{"page":"307-323","OA_place":"repository","volume":15751,"corr_author":"1","citation":{"short":"R. Neiheiser, E. Kokoris Kogias, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 307–323.","ieee":"R. Neiheiser and E. Kokoris Kogias, “Anthemius: Efficient and modular block assembly for concurrent execution,” in <i>29th International Conference on Financial Cryptography and Data Security</i>, Miyakojima, Japan, 2026, vol. 15751, pp. 307–323.","ista":"Neiheiser R, Kokoris Kogias E. 2026. Anthemius: Efficient and modular block assembly for concurrent execution. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15751, 307–323.","chicago":"Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” In <i>29th International Conference on Financial Cryptography and Data Security</i>, 15751:307–23. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-07024-1_18\">https://doi.org/10.1007/978-3-032-07024-1_18</a>.","apa":"Neiheiser, R., &#38; Kokoris Kogias, E. (2026). Anthemius: Efficient and modular block assembly for concurrent execution. In <i>29th International Conference on Financial Cryptography and Data Security</i> (Vol. 15751, pp. 307–323). Miyakojima, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-07024-1_18\">https://doi.org/10.1007/978-3-032-07024-1_18</a>","ama":"Neiheiser R, Kokoris Kogias E. Anthemius: Efficient and modular block assembly for concurrent execution. In: <i>29th International Conference on Financial Cryptography and Data Security</i>. Vol 15751. Springer Nature; 2026:307-323. doi:<a href=\"https://doi.org/10.1007/978-3-032-07024-1_18\">10.1007/978-3-032-07024-1_18</a>","mla":"Neiheiser, Ray, and Eleftherios Kokoris Kogias. “Anthemius: Efficient and Modular Block Assembly for Concurrent Execution.” <i>29th International Conference on Financial Cryptography and Data Security</i>, vol. 15751, Springer Nature, 2026, pp. 307–23, doi:<a href=\"https://doi.org/10.1007/978-3-032-07024-1_18\">10.1007/978-3-032-07024-1_18</a>."},"date_created":"2026-01-25T23:01:40Z","OA_type":"green","acknowledgement":"This work was supported by the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045.","department":[{"_id":"KrPi"}],"type":"conference","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032070234"],"eissn":["1611-3349"]},"_id":"21042","external_id":{"arxiv":["2502.10074"]},"conference":{"location":"Miyakojima, Japan","end_date":"2025-04-18","name":"FC: Financial Cryptography and Data Security","start_date":"2025-04-14"},"fulldoi":"https://doi.org/10.1007/978-3-032-07024-1_18","date_published":"2026-01-01T00:00:00Z","publication_status":"published","intvolume":"     15751","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2502.10074","open_access":"1"}],"alternative_title":["LNCS"],"arxiv":1,"doi":"10.1007/978-3-032-07024-1_18","project":[{"name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502"},{"name":"SeCure, privAte, and interoperabLe layEr 2","grant_number":"ICT22-045","_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Many blockchains such as Ethereum execute all incoming transactions sequentially significantly limiting the potential throughput. A common approach to scale execution is parallel execution engines that fully utilize modern multi-core architectures. Parallel execution is then either done optimistically, by executing transactions in parallel and detecting conflicts on the fly, or guided, by requiring exhaustive client transaction hints and scheduling transactions accordingly.\r\n\r\nHowever, recent studies have shown that the performance of parallel execution engines depends on the nature of the underlying workload. In fact, in some cases, only a 60% speed-up compared to sequential execution could be obtained. This is the case, as transactions that access the same resources must be executed sequentially. For example, if 10% of the transactions in a block access the same resource, the execution cannot meaningfully scale beyond 10 cores. Therefore, a single popular application can bottleneck the execution and limit the potential throughput.\r\n\r\nIn this paper, we introduce Anthemius, a block construction algorithm that optimizes parallel transaction execution throughput. We evaluate Anthemius exhaustively under a range of workloads, and show that Anthemius enables the underlying parallel execution engine to process over twice as many transactions."}],"oa_version":"Preprint","publication":"29th International Conference on Financial Cryptography and Data Security","year":"2026","month":"01","title":"Anthemius: Efficient and modular block assembly for concurrent execution","scopus_import":"1","author":[{"last_name":"Neiheiser","full_name":"Neiheiser, Ray","first_name":"Ray","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4","orcid":"0000-0001-7227-8309"},{"first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"}],"date_updated":"2026-02-12T13:39:07Z","oa":1,"status":"public"},{"title":"Pilotfish: Distributed execution for scalable blockchains","month":"01","scopus_import":"1","author":[{"last_name":"Kniep","full_name":"Kniep, Quentin","first_name":"Quentin"},{"full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"first_name":"Igor","full_name":"Zablotchi, Igor","last_name":"Zablotchi"},{"first_name":"Nuda","last_name":"Zhang","full_name":"Zhang, Nuda"}],"date_updated":"2026-02-16T07:56:09Z","status":"public","oa":1,"publication":"29th International Conference on Financial Cryptography and Data Security","year":"2026","abstract":[{"text":"Scalability is a crucial requirement for modern large-scale systems, enabling elasticity and ensuring responsiveness under varying load. While cloud systems have achieved scalable architectures, blockchain systems remain constrained by the need to over-provision validator machines to handle peak load. This leads to resource inefficiency, poor cost scaling, and limits on performance. To address these challenges, we introduce Pilotfish, the first scale-out transaction execution engine for blockchains. Pilotfish enables validators to scale horizontally by distributing transaction execution across multiple worker machines, allowing elasticity without compromising consistency or determinism. It integrates seamlessly with the lazy blockchain architecture, completing the missing piece of execution elasticity. To achieve this, Pilotfish tackles several key challenges: ensuring scalable and strongly consistent distributed transactions, handling partial crash recovery with lightweight replication, and maintaining concurrency with a novel versioned-queue scheduling algorithm. Our evaluation shows that Pilotfish scales linearly up to at least eight workers per validator for compute-bound workloads, while maintaining low latency. By solving scalable execution, Pilotfish brings blockchains closer to achieving end-to-end elasticity, unlocking new possibilities for efficient and adaptable blockchain systems.","lang":"eng"}],"oa_version":"Preprint","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"arxiv":1,"doi":"10.1007/978-3-032-07024-1_17","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2401.16292","open_access":"1"}],"date_published":"2026-01-01T00:00:00Z","intvolume":"     15751","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-032-07024-1_17","external_id":{"arxiv":["2401.16292"]},"conference":{"location":"Miyakojima, Japan","end_date":"2025-04-18","name":"FC: Financial Cryptography and Data Security","start_date":"2025-04-14"},"day":"01","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032070234"]},"_id":"21044","quality_controlled":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","type":"conference","OA_type":"green","citation":{"chicago":"Kniep, Quentin, Eleftherios Kokoris Kogias, Alberto Sonnino, Igor Zablotchi, and Nuda Zhang. “Pilotfish: Distributed Execution for Scalable Blockchains.” In <i>29th International Conference on Financial Cryptography and Data Security</i>, 15751:287–306. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-07024-1_17\">https://doi.org/10.1007/978-3-032-07024-1_17</a>.","apa":"Kniep, Q., Kokoris Kogias, E., Sonnino, A., Zablotchi, I., &#38; Zhang, N. (2026). Pilotfish: Distributed execution for scalable blockchains. In <i>29th International Conference on Financial Cryptography and Data Security</i> (Vol. 15751, pp. 287–306). Miyakojima, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-07024-1_17\">https://doi.org/10.1007/978-3-032-07024-1_17</a>","ama":"Kniep Q, Kokoris Kogias E, Sonnino A, Zablotchi I, Zhang N. Pilotfish: Distributed execution for scalable blockchains. In: <i>29th International Conference on Financial Cryptography and Data Security</i>. Vol 15751. Springer Nature; 2026:287-306. doi:<a href=\"https://doi.org/10.1007/978-3-032-07024-1_17\">10.1007/978-3-032-07024-1_17</a>","mla":"Kniep, Quentin, et al. “Pilotfish: Distributed Execution for Scalable Blockchains.” <i>29th International Conference on Financial Cryptography and Data Security</i>, vol. 15751, Springer Nature, 2026, pp. 287–306, doi:<a href=\"https://doi.org/10.1007/978-3-032-07024-1_17\">10.1007/978-3-032-07024-1_17</a>.","ista":"Kniep Q, Kokoris Kogias E, Sonnino A, Zablotchi I, Zhang N. 2026. Pilotfish: Distributed execution for scalable blockchains. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15751, 287–306.","short":"Q. Kniep, E. Kokoris Kogias, A. Sonnino, I. Zablotchi, N. Zhang, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 287–306.","ieee":"Q. Kniep, E. Kokoris Kogias, A. Sonnino, I. Zablotchi, and N. Zhang, “Pilotfish: Distributed execution for scalable blockchains,” in <i>29th International Conference on Financial Cryptography and Data Security</i>, Miyakojima, Japan, 2026, vol. 15751, pp. 287–306."},"date_created":"2026-01-25T23:01:41Z","page":"287-306","OA_place":"repository","volume":15751},{"date_updated":"2026-04-15T08:45:18Z","status":"public","oa":1,"scopus_import":"1","title":"On the (in)security of Proofs-of-space based longest-chain blockchains","month":"01","author":[{"last_name":"Baig","full_name":"Baig, Mirza Ahad","first_name":"Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"abstract":[{"text":"The Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.\r\nProofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.\r\nThe Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.\r\n\r\nProofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.\r\n\r\nConcretely, we consider a security game in which the honest parties at any point control 0 > 1\r\n times more space than the adversary. The adversary can change the honest space by a factor 1+- E with every block (dynamic availability), and “replotting” the space (which allows answering two challenges using the same space) takes as much time as p blocks.\r\nWe prove that no matter what chain selection rule is used, in this game the adversary can create a fork of length o^2 . p/E that will be picked as the winner by the chain selection rule.\r\nWe also provide an upper bound that matches the lower bound up to a factor o. There exists a chain selection rule (albeit a very strange one) which in the above game requires forks of length at least o . p/E\r\nOur results show the necessity of additional assumptions to create a secure PoSpace based longest-chain blockchain. The Chia network in addition to PoSpace uses a verifiable delay function. Our bounds show that an additional primitive like that is necessary.","lang":"eng"}],"oa_version":"Preprint","publication":"29th International Conference on Financial Cryptography and Data Security","year":"2026","doi":"10.1007/978-3-032-07035-7_8","alternative_title":["LNCS"],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Security and Privacy by Design for Complex Systems","grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1"}],"publisher":"Springer Nature","publication_status":"published","intvolume":"     15752","date_published":"2026-01-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.14891","open_access":"1"}],"conference":{"start_date":"2025-04-14","name":"FC: Financial Cryptography and Data Security","end_date":"2025-04-18","location":"Miyakojima, Japan"},"external_id":{"arxiv":["2505.14891"]},"fulldoi":"https://doi.org/10.1007/978-3-032-07035-7_8","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032070340"]},"_id":"21134","day":"01","OA_type":"green","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85.","department":[{"_id":"KrPi"}],"article_processing_charge":"No","type":"conference","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21651"}]},"OA_place":"repository","volume":15752,"page":"127-142","citation":{"short":"M.A. Baig, K.Z. Pietrzak, in:, 29th International Conference on Financial Cryptography and Data Security, Springer Nature, 2026, pp. 127–142.","ieee":"M. A. Baig and K. Z. Pietrzak, “On the (in)security of Proofs-of-space based longest-chain blockchains,” in <i>29th International Conference on Financial Cryptography and Data Security</i>, Miyakojima, Japan, 2026, vol. 15752, pp. 127–142.","ista":"Baig MA, Pietrzak KZ. 2026. On the (in)security of Proofs-of-space based longest-chain blockchains. 29th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 15752, 127–142.","apa":"Baig, M. A., &#38; Pietrzak, K. Z. (2026). On the (in)security of Proofs-of-space based longest-chain blockchains. In <i>29th International Conference on Financial Cryptography and Data Security</i> (Vol. 15752, pp. 127–142). Miyakojima, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-07035-7_8\">https://doi.org/10.1007/978-3-032-07035-7_8</a>","chicago":"Baig, Mirza Ahad, and Krzysztof Z Pietrzak. “On the (in)Security of Proofs-of-Space Based Longest-Chain Blockchains.” In <i>29th International Conference on Financial Cryptography and Data Security</i>, 15752:127–42. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-07035-7_8\">https://doi.org/10.1007/978-3-032-07035-7_8</a>.","ama":"Baig MA, Pietrzak KZ. On the (in)security of Proofs-of-space based longest-chain blockchains. In: <i>29th International Conference on Financial Cryptography and Data Security</i>. Vol 15752. Springer Nature; 2026:127-142. doi:<a href=\"https://doi.org/10.1007/978-3-032-07035-7_8\">10.1007/978-3-032-07035-7_8</a>","mla":"Baig, Mirza Ahad, and Krzysztof Z. Pietrzak. “On the (in)Security of Proofs-of-Space Based Longest-Chain Blockchains.” <i>29th International Conference on Financial Cryptography and Data Security</i>, vol. 15752, Springer Nature, 2026, pp. 127–42, doi:<a href=\"https://doi.org/10.1007/978-3-032-07035-7_8\">10.1007/978-3-032-07035-7_8</a>."},"date_created":"2026-02-01T23:01:43Z","corr_author":"1"},{"publication_identifier":{"isbn":["9783032139603"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"21135","day":"03","quality_controlled":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-032-13961-0_26","conference":{"end_date":"2025-09-23","location":"Daejeon, South Korea","name":"EMA4MICCAI: Efficient Medical Artificial Intelligence","start_date":"2025-09-23"},"citation":{"ama":"Troidl J, Liang Y, Beyer J, et al. niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. In: <i>1st International Workshop on Efficient Medical Artificial Intelligence</i>. Vol 16318. Springer Nature; 2026:257-267. doi:<a href=\"https://doi.org/10.1007/978-3-032-13961-0_26\">10.1007/978-3-032-13961-0_26</a>","chicago":"Troidl, Jakob, Yiqing Liang, Johanna Beyer, Mojtaba Tavakoli, Johann G Danzl, Markus Hadwiger, Hanspeter Pfister, and James Tompkin. “Niiv: Interactive Self-Supervised Neural Implicit Isotropic Volume Reconstruction.” In <i>1st International Workshop on Efficient Medical Artificial Intelligence</i>, 16318:257–67. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-13961-0_26\">https://doi.org/10.1007/978-3-032-13961-0_26</a>.","apa":"Troidl, J., Liang, Y., Beyer, J., Tavakoli, M., Danzl, J. G., Hadwiger, M., … Tompkin, J. (2026). niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. In <i>1st International Workshop on Efficient Medical Artificial Intelligence</i> (Vol. 16318, pp. 257–267). Daejeon, South Korea: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-13961-0_26\">https://doi.org/10.1007/978-3-032-13961-0_26</a>","mla":"Troidl, Jakob, et al. “Niiv: Interactive Self-Supervised Neural Implicit Isotropic Volume Reconstruction.” <i>1st International Workshop on Efficient Medical Artificial Intelligence</i>, vol. 16318, Springer Nature, 2026, pp. 257–67, doi:<a href=\"https://doi.org/10.1007/978-3-032-13961-0_26\">10.1007/978-3-032-13961-0_26</a>.","ista":"Troidl J, Liang Y, Beyer J, Tavakoli M, Danzl JG, Hadwiger M, Pfister H, Tompkin J. 2026. niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction. 1st International Workshop on Efficient Medical Artificial Intelligence. EMA4MICCAI: Efficient Medical Artificial Intelligence, LNCS, vol. 16318, 257–267.","short":"J. Troidl, Y. Liang, J. Beyer, M. Tavakoli, J.G. Danzl, M. Hadwiger, H. Pfister, J. Tompkin, in:, 1st International Workshop on Efficient Medical Artificial Intelligence, Springer Nature, 2026, pp. 257–267.","ieee":"J. Troidl <i>et al.</i>, “niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction,” in <i>1st International Workshop on Efficient Medical Artificial Intelligence</i>, Daejeon, South Korea, 2026, vol. 16318, pp. 257–267."},"date_created":"2026-02-01T23:01:44Z","OA_place":"repository","volume":16318,"page":"257-267","department":[{"_id":"JoDa"}],"article_processing_charge":"No","type":"conference","related_material":{"link":[{"url":"https://github.com/jakobtroidl/niiv-miccai","relation":"software"}]},"OA_type":"green","acknowledgement":"This work was supported by NIH grants 1U01NS132158 and R01HD104969. We thank the reviewers for their constructive feedback.","publication":"1st International Workshop on Efficient Medical Artificial Intelligence","year":"2026","abstract":[{"lang":"eng","text":"Three-dimensional (3D) microscopy data is often anisotropic with significantly lower resolution (up to 8x) along the z axis than along the xy axes. Computationally generating plausible isotropic resolution from anisotropic imaging data would benefit the visual analysis of large-scale volumes. This paper proposes niiv, a self-supervised method for isotropic reconstruction of 3D microscopy data that can quickly produce images at arbitrary output resolutions. The representation embeds a learned latent code within a neural field that describes the implicit higher-resolution isotropic image region. We use an attention-guided latent interpolation approach, which allows flexible information exchange over a local latent neighborhood. Under isotropic volume assumptions, we self-supervise this representation on low-/high-resolution lateral image pairs to reconstruct an isotropic volume from low-resolution axial images. We evaluate our method on simulated and real anisotropic electron (EM) and light microscopy (LM) data. Compared to diffusion-based baselines, niiv shows improved reconstruction quality (+1 dB PSNR) and is over three orders of magnitude faster (1,000x) to infer. Specifically, niiv reconstructs a 128^3 voxel volume in 2/10th of a second, renderable at varying (continuous) high resolutions for display. Our code is available at https://github.com/jakobtroidl/niiv-miccai."}],"oa_version":"Preprint","date_updated":"2026-02-16T08:50:50Z","status":"public","oa":1,"title":"niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction","scopus_import":"1","month":"01","author":[{"first_name":"Jakob","full_name":"Troidl, Jakob","last_name":"Troidl"},{"last_name":"Liang","full_name":"Liang, Yiqing","first_name":"Yiqing"},{"first_name":"Johanna","full_name":"Beyer, Johanna","last_name":"Beyer"},{"last_name":"Tavakoli","full_name":"Tavakoli, Mojtaba","orcid":"0000-0002-7667-6854","first_name":"Mojtaba","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G"},{"last_name":"Hadwiger","full_name":"Hadwiger, Markus","first_name":"Markus"},{"first_name":"Hanspeter","full_name":"Pfister, Hanspeter","last_name":"Pfister"},{"first_name":"James","full_name":"Tompkin, James","last_name":"Tompkin"}],"main_file_link":[{"url":"https://doi.org/10.1101/2024.09.07.611785","open_access":"1"}],"intvolume":"     16318","publication_status":"published","date_published":"2026-01-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","doi":"10.1007/978-3-032-13961-0_26","alternative_title":["LNCS"]},{"author":[{"first_name":"Todor","last_name":"Antić","full_name":"Antić, Todor"},{"first_name":"Aleksa","last_name":"Džuklevski","full_name":"Džuklevski, Aleksa"},{"full_name":"Fiala, Jiří","last_name":"Fiala","first_name":"Jiří"},{"first_name":"Jan","full_name":"Kratochvíl, Jan","last_name":"Kratochvíl"},{"first_name":"Giuseppe","full_name":"Liotta, Giuseppe","last_name":"Liotta"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian"},{"first_name":"Maria","last_name":"Saumell","full_name":"Saumell, Maria"},{"full_name":"Zink, Johannes","last_name":"Zink","first_name":"Johannes"}],"scopus_import":"1","month":"02","title":"Edge-constrained Hamiltonian paths on a point set","status":"public","oa":1,"date_updated":"2026-03-02T08:49:20Z","year":"2026","publication":"51st International Conference on Current Trends in Theory and Practice of Computer Science","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Let . S be a set of distinct points in general position in the\r\nEuclidean plane. A plane Hamiltonian path on . S is a crossing-free geometric path such that every point of .S is a vertex of the path. It is\r\nknown that, if. S is sufficiently large, there exist three edge-disjoint plane\r\nHamiltonian paths on . S. In this paper we study an edge-constrained\r\nversion of the problem of finding Hamiltonian paths on a point set. We\r\nfirst consider the problem of finding a single plane Hamiltonian path . π\r\nwith endpoints .s, t ∈ S and constraints given by a segment . ab, where\r\n.a, b ∈ S. We consider the following scenarios: (i) .ab ∈ π; (ii) .ab π. We\r\ncharacterize those quintuples . S, a, b, s, t for which . π exists. Secondly,\r\nwe consider the problem of finding two plane Hamiltonian paths . π1, π2\r\non a set . S with constraints given by a segment . ab, where .a, b ∈ S. We\r\nconsider the following scenarios: (i) .π1 and .π2 share no edges and .ab is\r\nan edge of . π1; (ii) .π1 and .π2 share no edges and none of them includes\r\n.ab as an edge; (iii) both .π1 and .π2 include .ab as an edge and share no\r\nother edges. In all cases, we characterize those triples . S, a, b for which\r\n.π1 and .π2 exist."}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"alternative_title":["LNCS"],"doi":"10.1007/978-3-032-17801-5_39","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.22526"}],"date_published":"2026-02-13T00:00:00Z","intvolume":"     16448","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-032-17801-5_39","external_id":{"arxiv":["2511.22526"]},"conference":{"start_date":"2026-02-09","name":"SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science","location":"Krakow, Poland","end_date":"2026-02-13"},"day":"13","_id":"21374","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032178008"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","article_processing_charge":"No","department":[{"_id":"HeEd"}],"acknowledgement":"We thank the organizers of the HOMONOLO 2024 workshop in Nová Louka, Czech Republic, for the fruitful atmosphere where the research on this project was initiated.\r\n\r\nT. Antić, A. Džuklevski, J. Kratochvíl and M. Saumell received funding from GAČR grant 23–04949X, T.A and A.Dž were additionally supported by GAUK grant SVV–2025–260822. G. Liotta was supported in part by MUR of Italy, PRIN Project no. 2022TS4Y3N – EXPAND and PON Project ARS01_00540. J. Fiala was in part supported by GAČR grant 25-16847S.","OA_type":"green","date_created":"2026-03-01T23:01:40Z","citation":{"ista":"Antić T, Džuklevski A, Fiala J, Kratochvíl J, Liotta G, Saghafian M, Saumell M, Zink J. 2026. Edge-constrained Hamiltonian paths on a point set. 51st International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science, LNCS, vol. 16448, 532–546.","short":"T. Antić, A. Džuklevski, J. Fiala, J. Kratochvíl, G. Liotta, M. Saghafian, M. Saumell, J. Zink, in:, 51st International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2026, pp. 532–546.","ieee":"T. Antić <i>et al.</i>, “Edge-constrained Hamiltonian paths on a point set,” in <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, Krakow, Poland, 2026, vol. 16448, pp. 532–546.","ama":"Antić T, Džuklevski A, Fiala J, et al. Edge-constrained Hamiltonian paths on a point set. In: <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 16448. Springer Nature; 2026:532-546. doi:<a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">10.1007/978-3-032-17801-5_39</a>","apa":"Antić, T., Džuklevski, A., Fiala, J., Kratochvíl, J., Liotta, G., Saghafian, M., … Zink, J. (2026). Edge-constrained Hamiltonian paths on a point set. In <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i> (Vol. 16448, pp. 532–546). Krakow, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">https://doi.org/10.1007/978-3-032-17801-5_39</a>","chicago":"Antić, Todor, Aleksa Džuklevski, Jiří Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, and Johannes Zink. “Edge-Constrained Hamiltonian Paths on a Point Set.” In <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, 16448:532–46. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">https://doi.org/10.1007/978-3-032-17801-5_39</a>.","mla":"Antić, Todor, et al. “Edge-Constrained Hamiltonian Paths on a Point Set.” <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, vol. 16448, Springer Nature, 2026, pp. 532–46, doi:<a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">10.1007/978-3-032-17801-5_39</a>."},"page":"532-546","volume":16448,"OA_place":"repository"},{"OA_place":"repository","volume":16444,"page":"386-401","citation":{"mla":"Jabal Ameli, Afrouz, et al. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” <i>20th International Conference and Workshops on Algorithms and Computation</i>, vol. 16444, Springer Nature, 2026, pp. 386–401, doi:<a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">10.1007/978-981-95-7127-7_26</a>.","ama":"Jabal Ameli A, Motiei F, Saghafian M. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In: <i>20th International Conference and Workshops on Algorithms and Computation</i>. Vol 16444. Springer Nature; 2026:386-401. doi:<a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">10.1007/978-981-95-7127-7_26</a>","chicago":"Jabal Ameli, Afrouz, Faezeh Motiei, and Morteza Saghafian. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” In <i>20th International Conference and Workshops on Algorithms and Computation</i>, 16444:386–401. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">https://doi.org/10.1007/978-981-95-7127-7_26</a>.","apa":"Jabal Ameli, A., Motiei, F., &#38; Saghafian, M. (2026). On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In <i>20th International Conference and Workshops on Algorithms and Computation</i> (Vol. 16444, pp. 386–401). Perugia, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">https://doi.org/10.1007/978-981-95-7127-7_26</a>","ieee":"A. Jabal Ameli, F. Motiei, and M. Saghafian, “On the MST-ratio: Theoretical bounds and complexity of finding the maximum,” in <i>20th International Conference and Workshops on Algorithms and Computation</i>, Perugia, Italy, 2026, vol. 16444, pp. 386–401.","short":"A. Jabal Ameli, F. Motiei, M. Saghafian, in:, 20th International Conference and Workshops on Algorithms and Computation, Springer Nature, 2026, pp. 386–401.","ista":"Jabal Ameli A, Motiei F, Saghafian M. 2026. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. 20th International Conference and Workshops on Algorithms and Computation. WALCOM: International Conference and Workshops on Algorithms and Computation, LNCS, vol. 16444, 386–401."},"date_created":"2026-03-08T23:01:45Z","OA_type":"green","acknowledgement":"A. J. Ameli—Supported by the project COALESCE (ERC grant no. 853234).\r\nM. Saghafian—Partially supported by the European Research Council (ERC), grant no. 788183, and by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","ec_funded":1,"department":[{"_id":"HeEd"}],"article_processing_charge":"No","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9789819571260"]},"_id":"21410","day":"14","conference":{"end_date":"2026-03-06","location":"Perugia, Italy","start_date":"2026-03-04","name":"WALCOM: International Conference and Workshops on Algorithms and Computation"},"external_id":{"arxiv":["2409.11079"]},"fulldoi":"https://doi.org/10.1007/978-981-95-7127-7_26","publication_status":"published","intvolume":"     16444","date_published":"2026-02-14T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.11079"}],"doi":"10.1007/978-981-95-7127-7_26","alternative_title":["LNCS"],"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer Nature","abstract":[{"lang":"eng","text":"Given a finite set of red and blue points in R^d, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning tree of their union. The MST-ratio has recently gained attention due to its direct interpretation in topological models for studying point sets with applications in spatial biology. The maximum MST-ratio of a point set is the maximum MST-ratio over all proper colorings of its points by red and blue. We prove that finding the maximum MST-ratio of a given point set is NP-hard when the dimension is part of the input. Moreover, we present a quadratic-time 3-approximation algorithm for this problem. As part of the proof, we show that in any metric space, the maximum MST-ratio is smaller than 3. Furthermore, we study the average MST-ratio over all colorings of a set of n points. We show that this average is always at least n-2/n-1, and for n random points uniformly distributed in a d-dimensional unit cube, the average tends to (math formular) in expectation as n approaches infinity."}],"oa_version":"Preprint","publication":"20th International Conference and Workshops on Algorithms and Computation","year":"2026","date_updated":"2026-03-09T10:25:41Z","status":"public","oa":1,"month":"02","scopus_import":"1","title":"On the MST-ratio: Theoretical bounds and complexity of finding the maximum","author":[{"first_name":"Afrouz","full_name":"Jabal Ameli, Afrouz","last_name":"Jabal Ameli"},{"last_name":"Motiei","full_name":"Motiei, Faezeh","first_name":"Faezeh"},{"last_name":"Saghafian","full_name":"Saghafian, Morteza","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}]},{"supplementarymaterial":"no","ec_funded":1,"acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093. Part of this work was realised when the first author was an FNRS aspirant at Université libre de Bruxelles.","OA_type":"hybrid","article_processing_charge":"Yes (in subscription journal)","type":"conference","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"page":"215-236","volume":16682,"OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-08-16T22:01:44Z","citation":{"mla":"Brice, Leonard J., et al. “Randomise Alone, Reach as a Team.” <i>38th International Conference on Computer Aided Verification</i>, vol. 16682, Springer Nature, 2026, pp. 215–36, doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_12\">10.1007/978-3-032-32519-8_12</a>.","chicago":"Brice, Leonard J, Thomas A Henzinger, Alipasha Montaseri, Ali Shafiee, and K. S. Thejaswini. “Randomise Alone, Reach as a Team.” In <i>38th International Conference on Computer Aided Verification</i>, 16682:215–36. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_12\">https://doi.org/10.1007/978-3-032-32519-8_12</a>.","ama":"Brice LJ, Henzinger TA, Montaseri A, Shafiee A, Thejaswini KS. Randomise alone, reach as a team. In: <i>38th International Conference on Computer Aided Verification</i>. Vol 16682. Springer Nature; 2026:215-236. doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_12\">10.1007/978-3-032-32519-8_12</a>","apa":"Brice, L. J., Henzinger, T. A., Montaseri, A., Shafiee, A., &#38; Thejaswini, K. S. (2026). Randomise alone, reach as a team. In <i>38th International Conference on Computer Aided Verification</i> (Vol. 16682, pp. 215–236). Lisbon, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_12\">https://doi.org/10.1007/978-3-032-32519-8_12</a>","ieee":"L. J. Brice, T. A. Henzinger, A. Montaseri, A. Shafiee, and K. S. Thejaswini, “Randomise alone, reach as a team,” in <i>38th International Conference on Computer Aided Verification</i>, Lisbon, Portugal, 2026, vol. 16682, pp. 215–236.","short":"L.J. Brice, T.A. Henzinger, A. Montaseri, A. Shafiee, K.S. Thejaswini, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 215–236.","ista":"Brice LJ, Henzinger TA, Montaseri A, Shafiee A, Thejaswini KS. 2026. Randomise alone, reach as a team. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification vol. 16682, 215–236."},"external_id":{"arxiv":["2603.07094"]},"conference":{"end_date":"2026-07-29","location":"Lisbon, Portugal","name":"CAV: Computer Aided Verification","start_date":"2026-07-26"},"file":[{"file_name":"2026_LNCS_Brice.pdf","creator":"dernst","relation":"main_file","access_level":"open_access","date_updated":"2026-08-18T06:53:22Z","content_type":"application/pdf","date_created":"2026-08-18T06:53:22Z","file_id":"22724","file_size":1902192,"checksum":"10ded8a3ab9ed34c9e4794c0b277622c","success":1}],"fulldoi":"https://doi.org/10.1007/978-3-032-32519-8_12","language":[{"iso":"eng"}],"quality_controlled":"1","day":"24","has_accepted_license":"1","_id":"22717","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032325181"],"issn":["0302-9743"]},"arxiv":1,"researchdata_availability":"yes","doi":"10.1007/978-3-032-32519-8_12","publisher":"Springer Nature","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-07-24T00:00:00Z","intvolume":"     16682","publication_status":"published","author":[{"last_name":"Brice","full_name":"Brice, Leonard J","id":"ce3b3409-db6c-11f0-aa64-ad678f7fd937","first_name":"Leonard J"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"id":"709a7f96-8896-11f0-9809-d75612fc0f2e","first_name":"Alipasha","full_name":"Montaseri, Alipasha","last_name":"Montaseri"},{"last_name":"Shafiee","full_name":"Shafiee, Ali","first_name":"Ali","id":"2783031a-7378-11f0-b2d0-f17f1db2ebad"},{"first_name":"K. S.","last_name":"Thejaswini","full_name":"Thejaswini, K. S."}],"title":"Randomise alone, reach as a team","scopus_import":"1","month":"07","status":"public","oa":1,"date_updated":"2026-08-18T06:55:38Z","file_date_updated":"2026-08-18T06:53:22Z","ddc":["000"],"oa_version":"Published Version","dataavailabilitystatement":"The artifact can be accessed at the link: https://doi. org/10.5281/zenodo.19680359.\r\nThe source code is available at:https://github.com/alipashamontaseri/Team-Concurrent-Game.","abstract":[{"text":"We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team players do not share a source of randomness, and their private random sources are hidden from the opponent and from each other.\r\n\r\nWe show that memoryless strategies are sufficient for the threshold problem (deciding whether there is a strategy for the team that ensures winning with probability that exceeds a threshold), a result that not only places the problem in the Existential Theory of the Reals (ER) but also enables the construction of value iteration algorithms. We additionally show that the threshold problem is NP-hard. For the almost-sure reachability problem, we prove NP-completeness.\r\n\r\nWe introduce Individually Randomised Alternating-time Temporal Logic (IRATL). This logic extends the standard ATL framework to reason about probability thresholds, with semantics explicitly designed for coalitions that lack a shared source of randomness. On the practical side, we implement and evaluate a solver for the threshold and almost-sure problem based on the algorithms that we develop.","lang":"eng"}],"das_tickbox":"1","year":"2026","publication":"38th International Conference on Computer Aided Verification"},{"date_published":"2026-07-24T00:00:00Z","intvolume":"     16682","publication_status":"published","alternative_title":["LNCS"],"arxiv":1,"researchdata_availability":"no","doi":"10.1007/978-3-032-32519-8_13","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"abstract":[{"text":"We study the problem of generating paths on a graph that satisfy a collection of w-regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler—oblivious to the graph and objective—dynamically composes these policies into a single path. We ask when such a composition satisfies all objectives, assuming their conjunction is realizable. The framework enables modular policy design but raises fundamental compositional challenges. We show that even extremely fair deterministic schedulers do not ensure correctness, and that stochastic schedulers, while necessary, are insufficient without coordination. For safety objectives, we demonstrate that fully decentralized implementations are impossible, and we introduce a protocol for synchronizing on maximal safe actions. For non-safety objectives, we introduce conventions—simple, a priori restrictions agreed upon before the graph or objectives are revealed—that guarantee satisfaction of all objectives when followed by all agents. We characterize minimally restrictive conventions for major subclasses of w-regular objectives. In particular, Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled.","lang":"eng"}],"oa_version":"Published Version","das_tickbox":"0","publication":"38th International Conference on Computer Aided Verification","year":"2026","month":"07","title":"Decoupled planning for multiple omega-regular objectives","scopus_import":"1","author":[{"full_name":"Avni, Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Mallik, Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik"},{"first_name":"Suman","full_name":"Sadhukhan, Suman","last_name":"Sadhukhan"},{"last_name":"Thejaswini","full_name":"Thejaswini, K. S.","first_name":"K. S."}],"date_updated":"2026-08-18T08:41:44Z","oa":1,"status":"public","file_date_updated":"2026-08-18T08:40:07Z","page":"237-257","OA_place":"publisher","volume":16682,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"ama":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. Decoupled planning for multiple omega-regular objectives. In: <i>38th International Conference on Computer Aided Verification</i>. Vol 16682. Springer Nature; 2026:237-257. doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">10.1007/978-3-032-32519-8_13</a>","apa":"Avni, G., Henzinger, T. A., Mallik, K., Sadhukhan, S., &#38; Thejaswini, K. S. (2026). Decoupled planning for multiple omega-regular objectives. In <i>38th International Conference on Computer Aided Verification</i> (Vol. 16682, pp. 237–257). Lisbon, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">https://doi.org/10.1007/978-3-032-32519-8_13</a>","chicago":"Avni, Guy, Thomas A Henzinger, Kaushik Mallik, Suman Sadhukhan, and K. S. Thejaswini. “Decoupled Planning for Multiple Omega-Regular Objectives.” In <i>38th International Conference on Computer Aided Verification</i>, 16682:237–57. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">https://doi.org/10.1007/978-3-032-32519-8_13</a>.","mla":"Avni, Guy, et al. “Decoupled Planning for Multiple Omega-Regular Objectives.” <i>38th International Conference on Computer Aided Verification</i>, vol. 16682, Springer Nature, 2026, pp. 237–57, doi:<a href=\"https://doi.org/10.1007/978-3-032-32519-8_13\">10.1007/978-3-032-32519-8_13</a>.","ista":"Avni G, Henzinger TA, Mallik K, Sadhukhan S, Thejaswini KS. 2026. Decoupled planning for multiple omega-regular objectives. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 16682, 237–257.","short":"G. Avni, T.A. Henzinger, K. Mallik, S. Sadhukhan, K.S. Thejaswini, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 237–257.","ieee":"G. Avni, T. A. Henzinger, K. Mallik, S. Sadhukhan, and K. S. Thejaswini, “Decoupled planning for multiple omega-regular objectives,” in <i>38th International Conference on Computer Aided Verification</i>, Lisbon, Portugal, 2026, vol. 16682, pp. 237–257."},"date_created":"2026-08-16T22:01:44Z","ec_funded":1,"supplementarymaterial":"no","OA_type":"hybrid","acknowledgement":"This work is funded by the following grants: European Research Council under Grant No.: ERC-2020-AdG 101020093, ISF grant no. 1679/21, grant RYC2024-049116, MICIU/AEI/10.13039/501100011033, the ESF+, and Volkswagen Foundation within its Momentum framework under project no. 9C283.","department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"Yes (in subscription journal)","quality_controlled":"1","language":[{"iso":"eng"}],"day":"24","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032325181"],"eissn":["1611-3349"]},"_id":"22719","external_id":{"arxiv":["2605.13185"]},"conference":{"name":"CAV: Computer Aided Verification","start_date":"2026-07-26","location":"Lisbon, Portugal","end_date":"2026-07-29"},"file":[{"date_updated":"2026-08-18T08:40:07Z","creator":"dernst","relation":"main_file","file_name":"2026_LNCS_Avni.pdf","access_level":"open_access","checksum":"f17ba3f82854fdb4eb69fd922965661a","success":1,"content_type":"application/pdf","date_created":"2026-08-18T08:40:07Z","file_size":531980,"file_id":"22730"}],"fulldoi":"https://doi.org/10.1007/978-3-032-32519-8_13"},{"supplementarymaterial":"no","ec_funded":1,"OA_type":"hybrid","acknowledgement":"This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412).","department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"No","page":"418-432","OA_place":"publisher","volume":16683,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"mla":"Henzinger, Thomas A., et al. “Extending QuAK with Nested Quantitative Automata.” <i>38th International Conference on Computer Aided Verification</i>, vol. 16683, Springer Nature, 2026, pp. 418–32, doi:<a href=\"https://doi.org/10.1007/978-3-032-32526-6_20\">10.1007/978-3-032-32526-6_20</a>.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, Naci E Sarac, and Harun Yılmaz. “Extending QuAK with Nested Quantitative Automata.” In <i>38th International Conference on Computer Aided Verification</i>, 16683:418–32. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-32526-6_20\">https://doi.org/10.1007/978-3-032-32526-6_20</a>.","apa":"Henzinger, T. A., Mazzocchi, N. A., Sarac, N. E., &#38; Yılmaz, H. (2026). Extending QuAK with nested quantitative automata. In <i>38th International Conference on Computer Aided Verification</i> (Vol. 16683, pp. 418–432). Lisbon, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-32526-6_20\">https://doi.org/10.1007/978-3-032-32526-6_20</a>","ama":"Henzinger TA, Mazzocchi NA, Sarac NE, Yılmaz H. Extending QuAK with nested quantitative automata. In: <i>38th International Conference on Computer Aided Verification</i>. Vol 16683. Springer Nature; 2026:418-432. doi:<a href=\"https://doi.org/10.1007/978-3-032-32526-6_20\">10.1007/978-3-032-32526-6_20</a>","ieee":"T. A. Henzinger, N. A. Mazzocchi, N. E. Sarac, and H. Yılmaz, “Extending QuAK with nested quantitative automata,” in <i>38th International Conference on Computer Aided Verification</i>, Lisbon, Portugal, 2026, vol. 16683, pp. 418–432.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, H. Yılmaz, in:, 38th International Conference on Computer Aided Verification, Springer Nature, 2026, pp. 418–432.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE, Yılmaz H. 2026. Extending QuAK with nested quantitative automata. 38th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 16683, 418–432."},"date_created":"2026-08-23T22:01:47Z","external_id":{"arxiv":["2605.12418"]},"conference":{"location":"Lisbon, Portugal","end_date":"2026-07-29","start_date":"2026-07-26","name":"CAV: Computer Aided Verification"},"file":[{"file_id":"22861","file_size":425988,"date_created":"2026-09-09T06:33:55Z","content_type":"application/pdf","success":1,"checksum":"043ba7b83f28d036d5a0e6e70a52cc9a","access_level":"open_access","file_name":"2026_LNCS_HenzingerT.pdf","relation":"main_file","creator":"dernst","date_updated":"2026-09-09T06:33:55Z"}],"fulldoi":"https://doi.org/10.1007/978-3-032-32526-6_20","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","has_accepted_license":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032325259"],"issn":["0302-9743"]},"_id":"22754","alternative_title":["LNCS"],"arxiv":1,"researchdata_availability":"yes","doi":"10.1007/978-3-032-32526-6_20","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2026-01-01T00:00:00Z","publication_status":"published","intvolume":"     16683","title":"Extending QuAK with nested quantitative automata","month":"01","scopus_import":"1","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi"},{"last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"},{"first_name":"Harun","last_name":"Yılmaz","full_name":"Yılmaz, Harun"}],"date_updated":"2026-09-09T06:37:41Z","status":"public","oa":1,"file_date_updated":"2026-09-09T06:33:55Z","ddc":["000"],"abstract":[{"lang":"eng","text":"Quantitative automata (QAs) extend finite-state automata on infinite words with weighted transitions to specify quantitative system properties. However, their finite weight sets rule out properties like average response time, where response times can be arbitrarily large. Nested quantitative automata (NQAs) overcome this limitation: a parent automaton spawns child automata to compute unbounded values over finite infixes and aggregates them into a final result. Despite this expressiveness, NQAs have lacked practical tool support to date.\r\n\r\nWe close this gap by extending the Quantitative Automata Kit (QuAK), a software tool for QA analysis, to support NQAs. Our core contribution is implementing a suite of flattening procedures that reduce NQAs to QAs, leveraging QuAK’s existing decision procedures. These reductions preserve the answers to threshold decision problems, while allowing users to specify properties in the more expressive NQA formalism. The tool handles all combinations of parent aggregators (including limits and averages) and child functions (extrema and monotonic or bounded summations) for which emptiness and universality are known to be decidable. Experiments on response-time and resource-consumption benchmarks demonstrate QuAK’s effectiveness."}],"dataavailabilitystatement":"The artifact supporting the experimental results in this paper is available in the QuAK repository at https://github.com/ista-vamos/nested-quak. It contains the extended QuAK implementation, benchmark generators, example inputs, and scripts/logs for reproducing the reported tables. The artifact is intended to reproduce the experiments under the setup described in Sect. 4; runtimes may vary across machines, and the reported timeout and memory-exhaustion results depend on the stated hardware limits. No sensitive or restricted data are used. An archived version is available on Zenodo at DOI: http://doi.org/10.5281/zenodo.19844606.","oa_version":"Published Version","das_tickbox":"1","publication":"38th International Conference on Computer Aided Verification","year":"2026"},{"oa_version":"Published Version","abstract":[{"text":"We introduce a new primitive, called beholder signatures (Full version [14] of the paper is available at https://eprint.iacr.org/2025/1900), which, in some sense, are the opposite of blind signatures. In a beholder signature, one signs a commitment to a (potentially very long) message, and the signature attests that the parties participating in the signing process, who know the secret key, jointly also know the entire committed message. This guarantee holds even against distributed adversaries that use secure multi-party computation (MPC) to produce the signature. We work in the distributed adversarial model (Dziembowski, Faust, and Lizurej, Crypto’23), where one assumes that it is infeasible to evaluate a large number of hash queries without any of the participating parties learning the input. We propose a construction of beholder signatures in the random oracle model. The starting point of our construction is proofs of complete knowledge, recently proposed by (Kelkar et al. CCS’24), which build on Fischlin’s transformation of a sigma protocol to a non-interactive, straight-line extractable zero-knowledge proof of knowledge. Our scheme is concretely efficient and comes with a proof-of-concept implementation using Schnorr as the underlying sigma protocol.\r\n\r\nThe primary applications of beholder signatures can be found within the blockchain space. In particular, we describe how to use them to construct proofs of custody (Feist, 2021) that do not require ephemeral keys and are non-interactive. We also outline applications to data dissemination, data availability, and proofs of replication.","lang":"eng"}],"das_tickbox":"0","year":"2026","publication":"46th Annual International Cryptology Conference","author":[{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"first_name":"Paweł","full_name":"Kedzior, Paweł","last_name":"Kedzior"},{"full_name":"Mielniczuk, Marcin","last_name":"Mielniczuk","first_name":"Marcin"},{"first_name":"Susil Kumar","full_name":"Mohanty, Susil Kumar","last_name":"Mohanty"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"title":"Beholder signatures","month":"08","scopus_import":"1","oa":1,"status":"public","date_updated":"2026-09-10T06:21:13Z","date_published":"2026-08-11T00:00:00Z","publication_status":"published","intvolume":"     16801","main_file_link":[{"url":"https://doi.org/10.1007/978-3-032-35374-0_5","open_access":"1"}],"researchdata_availability":"no","alternative_title":["LNCS"],"doi":"10.1007/978-3-032-35374-0_5","publisher":"Springer","project":[{"_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","grant_number":"F8509","name":"Security and Privacy by Design for Complex Systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"quality_controlled":"1","cryptoeprintid":1,"day":"11","_id":"22820","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032353733"],"eissn":["1611-3349"]},"external_id":{"cryptoeprintid":["2025/1900"]},"conference":{"start_date":"2026-08-17","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","end_date":"2026-08-20"},"fulldoi":"https://doi.org/10.1007/978-3-032-35374-0_5","page":"134-165","volume":16801,"OA_place":"publisher","date_created":"2026-09-06T22:01:58Z","citation":{"ista":"Dziembowski S, Faust S, Kedzior P, Mielniczuk M, Mohanty SK, Pietrzak KZ. 2026. Beholder signatures. 46th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16801, 134–165.","ieee":"S. Dziembowski, S. Faust, P. Kedzior, M. Mielniczuk, S. K. Mohanty, and K. Z. Pietrzak, “Beholder signatures,” in <i>46th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2026, vol. 16801, pp. 134–165.","short":"S. Dziembowski, S. Faust, P. Kedzior, M. Mielniczuk, S.K. Mohanty, K.Z. Pietrzak, in:, 46th Annual International Cryptology Conference, Springer, 2026, pp. 134–165.","mla":"Dziembowski, Stefan, et al. “Beholder Signatures.” <i>46th Annual International Cryptology Conference</i>, vol. 16801, Springer, 2026, pp. 134–65, doi:<a href=\"https://doi.org/10.1007/978-3-032-35374-0_5\">10.1007/978-3-032-35374-0_5</a>.","apa":"Dziembowski, S., Faust, S., Kedzior, P., Mielniczuk, M., Mohanty, S. K., &#38; Pietrzak, K. Z. (2026). Beholder signatures. In <i>46th Annual International Cryptology Conference</i> (Vol. 16801, pp. 134–165). Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-032-35374-0_5\">https://doi.org/10.1007/978-3-032-35374-0_5</a>","chicago":"Dziembowski, Stefan, Sebastian Faust, Paweł Kedzior, Marcin Mielniczuk, Susil Kumar Mohanty, and Krzysztof Z Pietrzak. “Beholder Signatures.” In <i>46th Annual International Cryptology Conference</i>, 16801:134–65. Springer, 2026. <a href=\"https://doi.org/10.1007/978-3-032-35374-0_5\">https://doi.org/10.1007/978-3-032-35374-0_5</a>.","ama":"Dziembowski S, Faust S, Kedzior P, Mielniczuk M, Mohanty SK, Pietrzak KZ. Beholder signatures. In: <i>46th Annual International Cryptology Conference</i>. Vol 16801. Springer; 2026:134-165. doi:<a href=\"https://doi.org/10.1007/978-3-032-35374-0_5\">10.1007/978-3-032-35374-0_5</a>"},"supplementarymaterial":"no","acknowledgement":"We used generative AI for grammar, spell checking, and basic editing. This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. This work has been partially funded by the European Research Council (ERC) under the European Union’s Horizon 2020 innovation program (grant CRYPTOLAYER-101044770), and by the European Research Council under the European Union’s Horizon 2020 innovation program (grant PROCONTRA-885666).","OA_type":"free access","article_processing_charge":"No","type":"conference","department":[{"_id":"KrPi"}]},{"fulldoi":"https://doi.org/10.1007/978-3-032-12293-3_9","conference":{"name":"TCC: Theory of Cryptography","start_date":"2025-12-01","end_date":"2025-12-05","location":"Aarhus, Denmark"},"day":"05","publication_identifier":{"isbn":["9783032122926"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"20845","quality_controlled":"1","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"article_processing_charge":"No","type":"conference","OA_type":"green","acknowledgement":"We thank Rachel Lin for expressing concern about the applicability of “HJL-style” attacks [15] on the construction in [2] during a talk by the first author about [2]. This was the starting point of the investigation that led us to develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for sharing his rationale for introducing evasive LWE.\r\nThe first author is supported by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship. The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras during which the collaboration was initiated. The 4th author is partly supported by JST CREST Grant Number JPMJCR22M1.","citation":{"mla":"Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16269, Springer Nature, 2025, pp. 259–90, doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>.","ama":"Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular evasive LWE. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16269. Springer Nature; 2025:259-290. doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>","apa":"Agrawal, S., Modi, A., Yadav, A., &#38; Yamada, S. (2025). Zeroizing attacks against evasive and circular evasive LWE. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>","chicago":"Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” In <i>23rd International Conference on Theory of Cryptography</i>, 16269:259–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>.","ieee":"S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive and circular evasive LWE,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","ista":"Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive and circular evasive LWE. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290."},"date_created":"2025-12-21T23:01:33Z","page":"259-290","OA_place":"repository","volume":16269,"scopus_import":"1","month":"12","title":"Zeroizing attacks against evasive and circular evasive LWE","author":[{"full_name":"Agrawal, Shweta","last_name":"Agrawal","first_name":"Shweta"},{"full_name":"Modi, Anuja","last_name":"Modi","first_name":"Anuja"},{"full_name":"Yadav, Anshu","last_name":"Yadav","first_name":"Anshu","id":"dc8f1524-403e-11ee-bf07-9649ad996e21"},{"last_name":"Yamada","full_name":"Yamada, Shota","first_name":"Shota"}],"date_updated":"2025-12-29T11:51:13Z","status":"public","oa":1,"publication":"23rd International Conference on Theory of Cryptography","year":"2025","abstract":[{"text":"We develop new attacks against the Evasive LWE family of assumptions, in both the public and private-coin regime. To the best of our knowledge, ours are the first attacks against Evasive LWE in the public-coin regime, for any instantiation from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption. This assumption has been popularly considered as a safe, public-coin instance of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10, 11]).\r\nWe provide the first attack against this assumption, challenging the widely held belief that this is a public-coin assumption.\r\n2. We demonstrate a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural parameter regime. Our attack crucially relies on the error in the pre-condition being larger than the error in the post-condition, necessitating a refinement of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal, Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against the assumption stated in the first posting of their work (subsequently refined to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently to [4]) provides a construction of obfuscation for pseudorandom functionalities by relying on private-coin evasive LWE. We provide a new attack against their stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived, “self-referential” classes of pseudorandom functionalities for which pseudorandom obfuscation cannot exist. We extend their techniques to develop an analogous result for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed to specifically avoid “zeroizing attacks”, our work shows that in certain settings, such attacks can still apply.","lang":"eng"}],"oa_version":"Preprint","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"doi":"10.1007/978-3-032-12293-3_9","main_file_link":[{"url":"https://eprint.iacr.org/2025/375","open_access":"1"}],"date_published":"2025-12-05T00:00:00Z","intvolume":"     16269","publication_status":"published"},{"alternative_title":["LNCS"],"doi":"10.1007/978-3-032-12290-2_16","project":[{"name":"Security and Privacy by Design for Complex Systems","grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-12-05T00:00:00Z","intvolume":"     16271","publication_status":"published","main_file_link":[{"url":"https://eprint.iacr.org/2025/1045","open_access":"1"}],"scopus_import":"1","month":"12","title":"Constrained verifiable random functions without obfuscation and friends","author":[{"first_name":"Nicholas","last_name":"Brandt","full_name":"Brandt, Nicholas"},{"orcid":"0000-0002-2505-4246","first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"last_name":"Günther","full_name":"Günther, Christoph Ullrich","first_name":"Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1"},{"last_name":"Ünal","full_name":"Ünal, Akin","orcid":"0000-0002-8929-0221","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a"},{"first_name":"Stella","full_name":"Wohnig, Stella","last_name":"Wohnig"}],"date_updated":"2025-12-29T11:11:29Z","oa":1,"status":"public","abstract":[{"lang":"eng","text":"CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.\r\nWe prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons."}],"oa_version":"Preprint","publication":"23rd International Conference on Theory of Cryptography","year":"2025","acknowledgement":"We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","OA_type":"green","department":[{"_id":"KrPi"}],"article_processing_charge":"No","type":"conference","page":"478-511","OA_place":"repository","volume":16271,"corr_author":"1","citation":{"ista":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained verifiable random functions without obfuscation and friends. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16271, 478–511.","short":"N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511.","ieee":"N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained verifiable random functions without obfuscation and friends,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16271, pp. 478–511.","chicago":"Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal, and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation and Friends.” In <i>23rd International Conference on Theory of Cryptography</i>, 16271:478–511. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>.","apa":"Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., &#38; Wohnig, S. (2025). Constrained verifiable random functions without obfuscation and friends. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16271, pp. 478–511). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>","ama":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable random functions without obfuscation and friends. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:478-511. doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>","mla":"Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation and Friends.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16271, Springer Nature, 2025, pp. 478–511, doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>."},"date_created":"2025-12-21T23:01:34Z","conference":{"start_date":"2025-12-01","name":"TCC: Theory of Cryptography","location":"Aarhus, Denmark","end_date":"2025-12-05"},"fulldoi":"https://doi.org/10.1007/978-3-032-12290-2_16","quality_controlled":"1","language":[{"iso":"eng"}],"day":"05","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122896"]},"_id":"20846"},{"publication":"25th International Conference on Runtime Verification","year":"2025","abstract":[{"text":"Neural certificates have emerged as a powerful tool in cyber-physical systems control, providing witnesses of correctness. These certificates, such as barrier functions, often learned alongside control policies, once verified, serve as mathematical proofs of system safety. However, traditional formal verification of their defining conditions typically faces scalability challenges due to exhaustive state-space exploration. To address this challenge, we propose a lightweight runtime monitoring framework that integrates real-time verification and does not require access to the underlying control policy. Our monitor observes the system during deployment and performs on-the-fly verification of the certificate over a lookahead region to ensure safety within a finite prediction horizon. We instantiate this framework for ReLU-based control barrier functions and demonstrate its practical effectiveness in a case study. Our approach enables timely detection of safety violations and incorrect certificates with minimal overhead, providing an effective but lightweight alternative to the static verification of the certificates.","lang":"eng"}],"oa_version":"Preprint","month":"09","title":"Formal verification of neural certificates done dynamically","author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kueffner, Konstantin","last_name":"Kueffner","orcid":"0000-0001-8974-2542","first_name":"Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi","orcid":"0000-0002-4993-773X","full_name":"Yu, Zhengqi","last_name":"Yu"}],"date_updated":"2026-02-16T11:53:25Z","status":"public","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.11987","open_access":"1"}],"date_published":"2025-09-13T00:00:00Z","intvolume":"     16087","publication_status":"published","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"arxiv":1,"doi":"10.1007/978-3-032-05435-7_4","day":"13","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783032054357"],"issn":["0302-9743"]},"_id":"21091","quality_controlled":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-032-05435-7_4","external_id":{"arxiv":["2507.11987"]},"conference":{"start_date":"2025-09-15","name":"RV: Runtime Verification","end_date":"2025-09-19","location":"Graz, Austria"},"corr_author":"1","citation":{"mla":"Henzinger, Thomas A., et al. “Formal Verification of Neural Certificates Done Dynamically.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 54–72, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">10.1007/978-3-032-05435-7_4</a>.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, and Emily Yu. “Formal Verification of Neural Certificates Done Dynamically.” In <i>25th International Conference on Runtime Verification</i>, 16087:54–72. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">https://doi.org/10.1007/978-3-032-05435-7_4</a>.","ama":"Henzinger TA, Kueffner K, Yu E. Formal verification of neural certificates done dynamically. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:54-72. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">10.1007/978-3-032-05435-7_4</a>","apa":"Henzinger, T. A., Kueffner, K., &#38; Yu, E. (2025). Formal verification of neural certificates done dynamically. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 54–72). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_4\">https://doi.org/10.1007/978-3-032-05435-7_4</a>","ista":"Henzinger TA, Kueffner K, Yu E. 2025. Formal verification of neural certificates done dynamically. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 54–72.","ieee":"T. A. Henzinger, K. Kueffner, and E. Yu, “Formal verification of neural certificates done dynamically,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 54–72.","short":"T.A. Henzinger, K. Kueffner, E. Yu, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 54–72."},"date_created":"2026-01-29T16:03:01Z","page":"54-72","OA_place":"repository","volume":16087,"department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"No","ec_funded":1,"OA_type":"green","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093."},{"external_id":{"arxiv":["2508.00021"]},"conference":{"start_date":"2025-09-15","name":"RV: Runtime Verification","end_date":"2025-09-19","location":"Graz, Austria"},"fulldoi":"https://doi.org/10.1007/978-3-032-05435-7_9","quality_controlled":"1","language":[{"iso":"eng"}],"day":"13","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783032054357"],"eissn":["1611-3349"]},"_id":"21092","ec_funded":1,"acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG 101020093.","OA_type":"green","department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"No","page":"140-159","OA_place":"repository","volume":16087,"corr_author":"1","citation":{"mla":"Henzinger, Thomas A., et al. “Alignment Monitoring.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 140–59, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">10.1007/978-3-032-05435-7_9</a>.","chicago":"Henzinger, Thomas A, Konstantin Kueffner, Vasu Singh, and I Sun. “Alignment Monitoring.” In <i>25th International Conference on Runtime Verification</i>, 16087:140–59. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">https://doi.org/10.1007/978-3-032-05435-7_9</a>.","apa":"Henzinger, T. A., Kueffner, K., Singh, V., &#38; Sun, I. (2025). Alignment monitoring. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 140–159). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">https://doi.org/10.1007/978-3-032-05435-7_9</a>","ama":"Henzinger TA, Kueffner K, Singh V, Sun I. Alignment monitoring. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:140-159. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_9\">10.1007/978-3-032-05435-7_9</a>","ieee":"T. A. Henzinger, K. Kueffner, V. Singh, and I. Sun, “Alignment monitoring,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 140–159.","short":"T.A. Henzinger, K. Kueffner, V. Singh, I. Sun, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 140–159.","ista":"Henzinger TA, Kueffner K, Singh V, Sun I. 2025. Alignment monitoring. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 140–159."},"date_created":"2026-01-29T16:03:43Z","title":"Alignment monitoring","month":"09","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Kueffner, Konstantin","last_name":"Kueffner","orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin"},{"full_name":"Singh, Vasu","last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"},{"first_name":"I","full_name":"Sun, I","last_name":"Sun"}],"date_updated":"2026-02-16T11:56:38Z","status":"public","oa":1,"abstract":[{"text":"Formal verification provides assurances that a probabilistic system satisfies its specification—conditioned on the system model being aligned with reality. We propose alignment monitoring to watch that this assumption is justified. We consider a probabilistic model well aligned if it accurately predicts the behaviour of an uncertain system in advance. An alignment score measures this by quantifying the similarity between the model’s predicted and the system’s (unknown) actual distributions. An alignment monitor observes the system at runtime; at each point in time it uses the current state and the model to predict the next state. After the next state is observed, the monitor updates the verdict, which is a high-probability interval estimate for the true alignment score. We utilize tools from sequential forecasting to construct our alignment monitors. Besides a monitor for measuring the expected alignment score, we introduce a differential alignment monitor, designed for comparing two models, and a weighted alignment monitor, which permits task-specific alignment monitoring. We evaluate our monitors experimentally on the PRISM benchmark suite. They are fast, memory-efficient, and detect misalignment early.","lang":"eng"}],"oa_version":"Preprint","publication":"25th International Conference on Runtime Verification","year":"2025","alternative_title":["LNCS"],"arxiv":1,"doi":"10.1007/978-3-032-05435-7_9","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-09-13T00:00:00Z","intvolume":"     16087","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.00021"}]},{"article_processing_charge":"No","type":"conference","department":[{"_id":"ToHe"}],"ec_funded":1,"OA_type":"green","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 and in part by the FWF-2022-SFB F8502 (SPyCoDe).","corr_author":"1","date_created":"2026-01-29T16:04:31Z","citation":{"mla":"Chalupa, Marek, et al. “Monitoring Hypernode Logic over Infinite Domains.” <i>25th International Conference on Runtime Verification</i>, vol. 16087, Springer Nature, 2025, pp. 417–37, doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">10.1007/978-3-032-05435-7_23</a>.","apa":"Chalupa, M., Henzinger, T. A., &#38; Oliveira da Costa, A. A. (2025). Monitoring hypernode logic over infinite domains. In <i>25th International Conference on Runtime Verification</i> (Vol. 16087, pp. 417–437). Graz, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">https://doi.org/10.1007/978-3-032-05435-7_23</a>","chicago":"Chalupa, Marek, Thomas A Henzinger, and Ana A Oliveira da Costa. “Monitoring Hypernode Logic over Infinite Domains.” In <i>25th International Conference on Runtime Verification</i>, 16087:417–37. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">https://doi.org/10.1007/978-3-032-05435-7_23</a>.","ama":"Chalupa M, Henzinger TA, Oliveira da Costa AA. Monitoring hypernode logic over infinite domains. In: <i>25th International Conference on Runtime Verification</i>. Vol 16087. Springer Nature; 2025:417-437. doi:<a href=\"https://doi.org/10.1007/978-3-032-05435-7_23\">10.1007/978-3-032-05435-7_23</a>","ieee":"M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Monitoring hypernode logic over infinite domains,” in <i>25th International Conference on Runtime Verification</i>, Graz, Austria, 2025, vol. 16087, pp. 417–437.","short":"M. Chalupa, T.A. Henzinger, A.A. Oliveira da Costa, in:, 25th International Conference on Runtime Verification, Springer Nature, 2025, pp. 417–437.","ista":"Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Monitoring hypernode logic over infinite domains. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 417–437."},"page":"417-437","volume":16087,"OA_place":"repository","fulldoi":"https://doi.org/10.1007/978-3-032-05435-7_23","external_id":{"arxiv":["2508.02301"]},"conference":{"name":"RV: Runtime Verification","start_date":"2025-09-15","location":"Graz, Austria","end_date":"2025-09-19"},"day":"13","_id":"21093","publication_identifier":{"eisbn":["9783032054357"],"issn":["0302-9743"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"Springer Nature","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"alternative_title":["LNCS"],"doi":"10.1007/978-3-032-05435-7_23","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.02301"}],"date_published":"2025-09-13T00:00:00Z","publication_status":"published","intvolume":"     16087","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"8b282559-50b0-11ef-861e-d6ace0d92e9b","first_name":"Ana A","last_name":"Oliveira da Costa","full_name":"Oliveira da Costa, Ana A"}],"month":"09","title":"Monitoring hypernode logic over infinite domains","status":"public","oa":1,"date_updated":"2026-02-16T11:59:20Z","year":"2025","publication":"25th International Conference on Runtime Verification","oa_version":"Preprint","abstract":[{"text":"We propose a monitoring approach for hyperproperties where the system’s observations range over infinite domains. The specifications are given as formulas of symbolic hypernode logic, an extension of earlier versions of hypernode logic that supports events with data. We demonstrate how to translate terms of symbolic hypernode logic into multi-tape symbolic transducers and we present a monitoring algorithm for universally quantified formulas that is based on this translation. We evaluate our approach against the previous approach for monitoring hypernode logic, and we also compare it to other monitors for hyperproperties.","lang":"eng"}]},{"conference":{"location":"Santa Barbara, CA, United States","end_date":"2025-08-221","name":"CRYPTO: International Cryptology Conference","start_date":"2025-08-17"},"fulldoi":"https://doi.org/10.1007/978-3-032-01887-8_19","language":[{"iso":"eng"}],"quality_controlled":"1","day":"17","_id":"21323","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032018861"],"eisbn":["9783032018878"]},"acknowledgement":"Juraj Belohorec, Pavel Hubáček, and Kristýna Mašková were partially supported by the Academy of Sciences of the Czech Republic (RVO 67985840), Czech Science Foundation GAČR grant No. 25-16311S, and by Zircuit. Pavel Dvořák was supported by Czech Science Foundation GAČR grant No. 22-14872O. Juraj Belohorec and Kristýna Mašková were supported by the grant SVV–2025–260822.","OA_type":"green","article_processing_charge":"No","type":"conference","department":[{"_id":"KrPi"}],"page":"584-616","volume":16005,"OA_place":"repository","date_created":"2026-02-18T10:59:58Z","citation":{"ista":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. 2025. On extractability of the KZG family of polynomial commitment schemes. 45th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16005, 584–616.","ieee":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, and M. Pastyřík, “On extractability of the KZG family of polynomial commitment schemes,” in <i>45th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2025, vol. 16005, pp. 584–616.","short":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, M. Pastyřík, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 584–616.","mla":"Belohorec, Juraj, et al. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” <i>45th Annual International Cryptology Conference</i>, vol. 16005, Springer Nature, 2025, pp. 584–616, doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>.","ama":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. On extractability of the KZG family of polynomial commitment schemes. In: <i>45th Annual International Cryptology Conference</i>. Vol 16005. Springer Nature; 2025:584-616. doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>","chicago":"Belohorec, Juraj, Pavel Dvořák, Charlotte Hoffmann, Pavel Hubáček, Kristýna Mašková, and Martin Pastyřík. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” In <i>45th Annual International Cryptology Conference</i>, 16005:584–616. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>.","apa":"Belohorec, J., Dvořák, P., Hoffmann, C., Hubáček, P., Mašková, K., &#38; Pastyřík, M. (2025). On extractability of the KZG family of polynomial commitment schemes. In <i>45th Annual International Cryptology Conference</i> (Vol. 16005, pp. 584–616). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>"},"author":[{"first_name":"Juraj","last_name":"Belohorec","full_name":"Belohorec, Juraj"},{"full_name":"Dvořák, Pavel","last_name":"Dvořák","first_name":"Pavel"},{"orcid":"0000-0003-2027-5549","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","first_name":"Charlotte","full_name":"Hoffmann, Charlotte","last_name":"Hoffmann"},{"last_name":"Hubáček","full_name":"Hubáček, Pavel","first_name":"Pavel"},{"last_name":"Mašková","full_name":"Mašková, Kristýna","first_name":"Kristýna"},{"first_name":"Martin","full_name":"Pastyřík, Martin","last_name":"Pastyřík"}],"title":"On extractability of the KZG family of polynomial commitment schemes","month":"08","oa":1,"status":"public","date_updated":"2026-02-19T07:50:33Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a unifying framework for proving the knowledge-soundness of KZG-like polynomial commitment schemes, encompassing both univariate and multivariate variants. By conceptualizing the proof technique of Lipmaa, Parisella, and Siim for the univariate KZG scheme (EUROCRYPT 2024), we present tools and falsifiable hardness assumptions that permit black-box extraction of the multivariate KZG scheme. Central to our approach is the notion of a canonical Proof-of-Knowledge of a Polynomial (PoKoP) of a polynomial commitment scheme, which we use to capture the extractability notion required in constructions of practical zk-SNARKs. We further present an explicit polynomial decomposition lemma for multivariate polynomials, enabling a more direct analysis of interpolating extractors and bridging the gap between univariate and multivariate commitments. Our results provide the first standard-model proofs of extractability for the multivariate KZG scheme and many of its variants under falsifiable assumptions."}],"year":"2025","publication":"45th Annual International Cryptology Conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-032-01887-8_19","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-08-17T00:00:00Z","intvolume":"     16005","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/514"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"publisher":"Springer Nature","doi":"10.1007/978-3-031-82703-7_5","alternative_title":["LNCS"],"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.18293"}],"intvolume":"     15530","publication_status":"published","date_published":"2025-01-23T00:00:00Z","date_updated":"2025-09-30T10:46:54Z","oa":1,"status":"public","scopus_import":"1","month":"01","title":"1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization","author":[{"first_name":"Muqsit","full_name":"Azeem, Muqsit","last_name":"Azeem"},{"first_name":"Debraj","last_name":"Chakraborty","full_name":"Chakraborty, Debraj"},{"first_name":"Sudeep","last_name":"Kanav","full_name":"Kanav, Sudeep"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"full_name":"Mohagheghi, Mohammadsadegh","last_name":"Mohagheghi","first_name":"Mohammadsadegh"},{"first_name":"Stefanie","full_name":"Mohr, Stefanie","last_name":"Mohr"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","first_name":"Maximilian","full_name":"Weininger, Maximilian","last_name":"Weininger"}],"publication":"26th International Conference on Verification, Model Checking, and Abstract Interpretation","year":"2025","isi":1,"abstract":[{"text":"Despite the advances in probabilistic model checking, the scalability of the verification methods remains limited. In particular, the state space often becomes extremely large when instantiating parameterized Markov decision processes (MDPs) even with moderate values. Synthesizing policies for such huge MDPs is beyond the reach of available tools. We propose a learning-based approach to obtain a reasonable policy for such huge MDPs.\r\n\r\nThe idea is to generalize optimal policies obtained by model-checking small instances to larger ones using decision-tree learning. Consequently, our method bypasses the need for explicit state-space exploration of large models, providing a practical solution to the state-space explosion problem. We demonstrate the efficacy of our approach by performing extensive experimentation on the relevant models from the quantitative verification benchmark set. The experimental results indicate that our policies perform well, even when the size of the model is orders of magnitude beyond the reach of state-of-the-art analysis tools.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"KrCh"}],"type":"conference","article_processing_charge":"No","acknowledgement":"This research was funded in part by the DFG project 427755713 GOPro, the DFG GRK 2428 (ConVeY), the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant Agency of Masaryk University, and the EU under MSCA grant agreement 101034413 (IST-BRIDGE).","OA_type":"green","ec_funded":1,"citation":{"chicago":"Azeem, Muqsit, Debraj Chakraborty, Sudeep Kanav, Jan Kretinsky, Mohammadsadegh Mohagheghi, Stefanie Mohr, and Maximilian Weininger. “1–2–3–Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization.” In <i>26th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, 15530:97–120. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-82703-7_5\">https://doi.org/10.1007/978-3-031-82703-7_5</a>.","apa":"Azeem, M., Chakraborty, D., Kanav, S., Kretinsky, J., Mohagheghi, M., Mohr, S., &#38; Weininger, M. (2025). 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. In <i>26th International Conference on Verification, Model Checking, and Abstract Interpretation</i> (Vol. 15530, pp. 97–120). Denver, CO, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-82703-7_5\">https://doi.org/10.1007/978-3-031-82703-7_5</a>","ama":"Azeem M, Chakraborty D, Kanav S, et al. 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. In: <i>26th International Conference on Verification, Model Checking, and Abstract Interpretation</i>. Vol 15530. Springer Nature; 2025:97-120. doi:<a href=\"https://doi.org/10.1007/978-3-031-82703-7_5\">10.1007/978-3-031-82703-7_5</a>","mla":"Azeem, Muqsit, et al. “1–2–3–Go! Policy Synthesis for Parameterized Markov Decision Processes via Decision-Tree Learning and Generalization.” <i>26th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, vol. 15530, Springer Nature, 2025, pp. 97–120, doi:<a href=\"https://doi.org/10.1007/978-3-031-82703-7_5\">10.1007/978-3-031-82703-7_5</a>.","short":"M. Azeem, D. Chakraborty, S. Kanav, J. Kretinsky, M. Mohagheghi, S. Mohr, M. Weininger, in:, 26th International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2025, pp. 97–120.","ieee":"M. Azeem <i>et al.</i>, “1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization,” in <i>26th International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Denver, CO, United States, 2025, vol. 15530, pp. 97–120.","ista":"Azeem M, Chakraborty D, Kanav S, Kretinsky J, Mohagheghi M, Mohr S, Weininger M. 2025. 1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization. 26th International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 15530, 97–120."},"date_created":"2025-03-09T23:01:29Z","OA_place":"repository","volume":15530,"page":"97-120","fulldoi":"https://doi.org/10.1007/978-3-031-82703-7_5","conference":{"name":"VMCAI: Verification, Model Checking, and Abstract Interpretation","start_date":"2025-01-20","end_date":"2025-01-21","location":"Denver, CO, United States"},"external_id":{"isi":["001446577100005"],"arxiv":["2410.18293"]},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031827020"],"eissn":["1611-3349"]},"_id":"19375","day":"23","quality_controlled":"1","language":[{"iso":"eng"}]},{"external_id":{"arxiv":["2411.12582"],"isi":["001537885900016"]},"conference":{"end_date":"2025-03-02","location":"Chengdu, China","name":"WALCOM: International Conference and Workshops on Algorithms and Computation","start_date":"2025-02-28"},"fulldoi":"https://doi.org/10.1007/978-981-96-2845-2_16","quality_controlled":"1","language":[{"iso":"eng"}],"day":"20","publication_identifier":{"isbn":["9789819628445"],"issn":["0302-9743"],"eissn":["1611-3349"]},"_id":"19445","ec_funded":1,"OA_type":"green","acknowledgement":"J. M. Křišťan acknowledges the support of the Czech Science Foundation Grant No. 24-12046S. This work was supported by the Grant Agency of the Czech Technical University in Prague, grant No. SGS23/205/OHK3/3T/18. J. Svoboda acknowledges the support of the ERC CoG 863818 (ForM-SMArt) grant.","department":[{"_id":"KrCh"}],"type":"conference","article_processing_charge":"No","page":"244-265","OA_place":"repository","volume":15411,"citation":{"short":"J.M. Křišťan, J. Svoboda, in:, 19th International Conference and Workshops on Algorithms and Computation, Springer Nature, 2025, pp. 244–265.","ieee":"J. M. Křišťan and J. Svoboda, “Reconfiguration using generalized token jumping,” in <i>19th International Conference and Workshops on Algorithms and Computation</i>, Chengdu, China, 2025, vol. 15411, pp. 244–265.","ista":"Křišťan JM, Svoboda J. 2025. Reconfiguration using generalized token jumping. 19th International Conference and Workshops on Algorithms and Computation. WALCOM: International Conference and Workshops on Algorithms and Computation, LNCS, vol. 15411, 244–265.","ama":"Křišťan JM, Svoboda J. Reconfiguration using generalized token jumping. In: <i>19th International Conference and Workshops on Algorithms and Computation</i>. Vol 15411. Springer Nature; 2025:244-265. doi:<a href=\"https://doi.org/10.1007/978-981-96-2845-2_16\">10.1007/978-981-96-2845-2_16</a>","apa":"Křišťan, J. M., &#38; Svoboda, J. (2025). Reconfiguration using generalized token jumping. In <i>19th International Conference and Workshops on Algorithms and Computation</i> (Vol. 15411, pp. 244–265). Chengdu, China: Springer Nature. <a href=\"https://doi.org/10.1007/978-981-96-2845-2_16\">https://doi.org/10.1007/978-981-96-2845-2_16</a>","chicago":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Reconfiguration Using Generalized Token Jumping.” In <i>19th International Conference and Workshops on Algorithms and Computation</i>, 15411:244–65. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-981-96-2845-2_16\">https://doi.org/10.1007/978-981-96-2845-2_16</a>.","mla":"Křišťan, Jan Matyáš, and Jakub Svoboda. “Reconfiguration Using Generalized Token Jumping.” <i>19th International Conference and Workshops on Algorithms and Computation</i>, vol. 15411, Springer Nature, 2025, pp. 244–65, doi:<a href=\"https://doi.org/10.1007/978-981-96-2845-2_16\">10.1007/978-981-96-2845-2_16</a>."},"date_created":"2025-03-23T23:01:27Z","month":"02","title":"Reconfiguration using generalized token jumping","scopus_import":"1","author":[{"last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš","first_name":"Jan Matyáš"},{"first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda"}],"date_updated":"2025-09-30T11:14:33Z","oa":1,"status":"public","abstract":[{"text":"In reconfiguration, we are given two solutions to a graph problem, such as Vertex Cover or Dominating Set, with each solution represented by a placement of tokens on vertices of the graph. Our task is to reconfigure one into the other using small steps while ensuring the intermediate configurations of tokens are also valid solutions. The two commonly studied settings are Token Jumping and Token Sliding, which allows moving a single token to an arbitrary or an adjacent vertex, respectively.\r\n\r\nWe introduce new rules that generalize Token Jumping, parameterized by the number of tokens allowed to move at once and by the maximum distance of each move. Our main contribution is identifying minimal rules that allow reconfiguring any possible given solution into any other for Independent Set, Vertex Cover, and Dominating Set. For each minimal rule, we also provide an efficient algorithm that finds a corresponding reconfiguration sequence.\r\n\r\nWe further focus on the rule that allows each token to move to an adjacent vertex in a single step. This natural variant turns out to be the minimal rule that guarantees reconfigurability for Vertex Cover. We determine the computational complexity of deciding whether a (shortest) reconfiguration sequence exists under this rule for the three studied problems. While reachability for Vertex Cover is shown to be in P, finding a shortest sequence is shown to be NP-complete. For Independent Set and Dominating Set, even reachability is shown to be PSPACE-complete.","lang":"eng"}],"oa_version":"Preprint","isi":1,"publication":"19th International Conference and Workshops on Algorithms and Computation","year":"2025","alternative_title":["LNCS"],"arxiv":1,"doi":"10.1007/978-981-96-2845-2_16","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"publisher":"Springer Nature","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2025-02-20T00:00:00Z","publication_status":"published","intvolume":"     15411","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2411.12582"}]},{"OA_type":"green","acknowledgement":"This work was supported in part by the ERC CoG 863818 (ForM-SMArt), Austrian Science Fund (FWF) 10.55776/COE12, and MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms) grants.","ec_funded":1,"department":[{"_id":"KrPi"},{"_id":"KrCh"}],"type":"conference","article_processing_charge":"No","OA_place":"repository","volume":15263,"page":"207-223","citation":{"ama":"Avarikioti Z, Bastankhah M, Maddah-Ali MA, Pietrzak KZ, Svoboda J, Yeo MX. Route discovery in private payment channel networks. In: <i>Computer Security. ESORICS 2024 International Workshops</i>. Vol 15263. Springer Nature; 2025:207-223. doi:<a href=\"https://doi.org/10.1007/978-3-031-82349-7_15\">10.1007/978-3-031-82349-7_15</a>","chicago":"Avarikioti, Zeta, Mahsa Bastankhah, Mohammad Ali Maddah-Ali, Krzysztof Z Pietrzak, Jakub Svoboda, and Michelle X Yeo. “Route Discovery in Private Payment Channel Networks.” In <i>Computer Security. ESORICS 2024 International Workshops</i>, 15263:207–23. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-82349-7_15\">https://doi.org/10.1007/978-3-031-82349-7_15</a>.","apa":"Avarikioti, Z., Bastankhah, M., Maddah-Ali, M. A., Pietrzak, K. Z., Svoboda, J., &#38; Yeo, M. X. (2025). Route discovery in private payment channel networks. In <i>Computer Security. ESORICS 2024 International Workshops</i> (Vol. 15263, pp. 207–223). Bydgoszcz, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-82349-7_15\">https://doi.org/10.1007/978-3-031-82349-7_15</a>","mla":"Avarikioti, Zeta, et al. “Route Discovery in Private Payment Channel Networks.” <i>Computer Security. ESORICS 2024 International Workshops</i>, vol. 15263, Springer Nature, 2025, pp. 207–23, doi:<a href=\"https://doi.org/10.1007/978-3-031-82349-7_15\">10.1007/978-3-031-82349-7_15</a>.","short":"Z. Avarikioti, M. Bastankhah, M.A. Maddah-Ali, K.Z. Pietrzak, J. Svoboda, M.X. Yeo, in:, Computer Security. ESORICS 2024 International Workshops, Springer Nature, 2025, pp. 207–223.","ieee":"Z. Avarikioti, M. Bastankhah, M. A. Maddah-Ali, K. Z. Pietrzak, J. Svoboda, and M. X. Yeo, “Route discovery in private payment channel networks,” in <i>Computer Security. ESORICS 2024 International Workshops</i>, Bydgoszcz, Poland, 2025, vol. 15263, pp. 207–223.","ista":"Avarikioti Z, Bastankhah M, Maddah-Ali MA, Pietrzak KZ, Svoboda J, Yeo MX. 2025. Route discovery in private payment channel networks. Computer Security. ESORICS 2024 International Workshops. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 15263, 207–223."},"date_created":"2025-04-20T22:01:28Z","conference":{"location":"Bydgoszcz, Poland","end_date":"2024-09-20","start_date":"2024-09-16","name":"ESORICS: European Symposium on Research in Computer Security"},"fulldoi":"https://doi.org/10.1007/978-3-031-82349-7_15","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031823480"],"eissn":["1611-3349"]},"_id":"19600","day":"01","doi":"10.1007/978-3-031-82349-7_15","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"publisher":"Springer Nature","intvolume":"     15263","publication_status":"published","date_published":"2025-04-01T00:00:00Z","main_file_link":[{"url":"https://eprint.iacr.org/2021/1539","open_access":"1"}],"date_updated":"2025-11-05T07:52:35Z","oa":1,"status":"public","month":"04","title":"Route discovery in private payment channel networks","scopus_import":"1","author":[{"first_name":"Zeta","full_name":"Avarikioti, Zeta","last_name":"Avarikioti"},{"last_name":"Bastankhah","full_name":"Bastankhah, Mahsa","first_name":"Mahsa"},{"last_name":"Maddah-Ali","full_name":"Maddah-Ali, Mohammad Ali","first_name":"Mohammad Ali"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Svoboda, Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","orcid":"0000-0002-1419-3267"},{"full_name":"Yeo, Michelle X","last_name":"Yeo","orcid":"0009-0001-3676-4809","first_name":"Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"In this work, we explore route discovery in private payment channel networks. We first determine what “ideal\" privacy for a routing protocol means in this setting. We observe that protocols achieving this strong privacy definition exist by leveraging Multi-Party Computation but they are inherently inefficient as they must involve the entire network. We then present protocols with weaker privacy guarantees but much better efficiency (involving only a small fraction of the nodes). The core idea is that both sender and receiver gossip a message which propagates through the network, and the moment any node in the network receives both messages, a path is found. In our first protocol the message is always sent to all neighbouring nodes with a delay proportional to the fees of that edge. In our second protocol the message is only sent to one neighbour chosen randomly with a probability proportional to its degree. We additionally propose a more realistic notion of privacy in order to measure the privacy leakage of our protocols in practice. Our realistic notion of privacy challenges an adversary that join the network with a fixed budget to create channels to guess the sender and receiver of a transaction upon receiving messages from our protocols. Simulations of our protocols on the Lightning network topology (for random transactions and uniform fees) show that 1) forming edges with high degree nodes is a more effective attack strategy for the adversary, 2) there is a tradeoff between the number of nodes involved in our protocols (privacy) and the optimality of the discovered path, and 3) our protocols involve a very small fraction of the network on average.","lang":"eng"}],"oa_version":"Submitted Version","publication":"Computer Security. ESORICS 2024 International Workshops","year":"2025"}]