Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
137 Publications
2022 | Conference Paper | IST-REx-ID: 12176 | 
C. Hoffmann, P. Hubáček, C. Kamath, K. Klein, and K. Z. Pietrzak, “Practical statistically-sound proofs of exponentiation in any group,” in Advances in Cryptology – CRYPTO 2022, Santa Barbara, CA, United States, 2022, vol. 13508, pp. 370–399.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2022 | Conference Paper | IST-REx-ID: 12298 |
R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang, “Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,” in Financial Cryptography and Data Security, Radisson Grenada Beach Resort, Grenada, 2022, vol. 13411, pp. 296–315.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12168 |
S. Cohen et al., “Be aware of your leaders,” in International Conference on Financial Cryptography and Data Security, Grenada, 2022, vol. 13411, pp. 279–295.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12175 |
S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2022 | Conference Paper | IST-REx-ID: 11185 |
A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” in WALCOM 2022: Algorithms and Computation, Jember, Indonesia, 2022, vol. 13174, pp. 383–395.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12000 |
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 11771 |
M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 9210 |
V. Volhejn and C. Lampert, “Does SGD implicitly optimize for smoothness?,” in 42nd German Conference on Pattern Recognition, Tübingen, Germany, 2021, vol. 12544, pp. 246–259.
[Submitted Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 9620 |
D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12.
[Preprint]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 12767 |
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10076 |
S. Blackshear et al., “Reactive key-loss protection in blockchains,” in FC 2021 Workshops, Virtual, 2021, vol. 12676, pp. 431–450.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10108 |
F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.
[Preprint]
View
| Files available
| DOI
| WoS
2021 | Conference Paper | IST-REx-ID: 10325 |
A. Zamyatin et al., “SoK: Communication across distributed ledgers,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 3–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10324 |
Z. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick: Asynchronous incentive-compatible payment channels,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 209–230.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10407 |
S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K. Z. Pietrzak, and M. X. Yeo, “Trojan-resilience without cryptography,” presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 397–428.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10408 |
J. F. Alwen et al., “Grafting key trees: Efficient key management for overlapping groups,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13044, pp. 222–253.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10409 |
C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 486–517.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10609 |
S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls for adaptively secure MPC without setup,” in 27th International Conference on the Theory and Application of Cryptology and Information Security, Virtual, Singapore, 2021, vol. 13091, pp. 335–364.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 9987 |
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv