Schmid, S., Svoboda, J., &; Yeo, M. X. (2024). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.114353 
LibreCat: https://research-explorer.ista.ac.at/record/14820
DOI: 10.1016/j.tcs.2023.114353

Alpos, O., Amores-Sesar, I., Cachin, C., &; Yeo, M. X. (2024). Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2023.12 
LibreCat: https://research-explorer.ista.ac.at/record/15007
DOI: 10.4230/LIPIcs.OPODIS.2023.12
arXiv: 2307.02954

Hoffmann, C., Hubádek, P., Kamath, C., &; Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-31368-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/13143
DOI: 10.1007/978-3-031-31368-4_19

Baig, M. A., Hendler, D., Milani, A., &; Travers, C. (2023). Long-lived counters with polylogarithmic amortized step complexity. Distributed Computing. Springer Nature.https://doi.org/10.1007/s00446-022-00439-5 
LibreCat: https://research-explorer.ista.ac.at/record/12164
DOI: 10.1007/s00446-022-00439-5
WoS: 000890138700001

Dodis, Y., Ferguson, N., Goldin, E., Hall, P., &; Pietrzak, K. Z. (2023). Random oracle combiners: Breaking the concatenation barrier for collision-resistance. In 43rd Annual International Cryptology Conference (Vol. 14082, pp. 514–546). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-38545-2_17 
LibreCat: https://research-explorer.ista.ac.at/record/14428
DOI: 10.1007/978-3-031-38545-2_17

Hoffmann, C., &; Simkin, M. (2023). Stronger lower bounds for leakage-resilient secret sharing. In 8th International Conference on Cryptology and Information Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer Nature.https://doi.org/10.1007/978-3-031-44469-2_11 
LibreCat: https://research-explorer.ista.ac.at/record/14457
DOI: 10.1007/978-3-031-44469-2_11

Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. In SIROCCO 2023: Structural Information and Communication Complexity  (Vol. 13892, pp. 576–594). Alcala de Henares, Spain: Springer Nature.https://doi.org/10.1007/978-3-031-32733-9_26 
LibreCat: https://research-explorer.ista.ac.at/record/13238
DOI: 10.1007/978-3-031-32733-9_26
arXiv: 2204.13459

Yeo, M. X. (2023). Advances in efficiency and privacy in payment channel network analysis. Institute of Science and Technology Austria.https://doi.org/10.15479/14506 
LibreCat: https://research-explorer.ista.ac.at/record/14506
DOI: 10.15479/14506

Avarikioti, Z., Lizurej, T., Michalak, T., &; Yeo, M. X. (2023). Lightning creation games. In 43rd International Conference on Distributed Computing Systems (Vol. 2023, pp. 603–613). Hong Kong, China: IEEE.https://doi.org/10.1109/ICDCS57875.2023.00037 
LibreCat: https://research-explorer.ista.ac.at/record/14490
DOI: 10.1109/ICDCS57875.2023.00037
arXiv: 2306.16006

Hoffmann, C., Hubádek, P., Kamath, C., &; Krák, T. (2023). (Verifiable) delay functions from Lucas sequences. In 21st International Conference on Theory of Cryptography (Vol. 14372, pp. 336–362). Taipei, Taiwan: Springer Nature.https://doi.org/10.1007/978-3-031-48624-1_13 
LibreCat: https://research-explorer.ista.ac.at/record/14693
DOI: 10.1007/978-3-031-48624-1_13

Auerbach, B., Cueto Noval, M., Pascual Perez, G., &; Pietrzak, K. Z. (2023). On the cost of post-compromise security in concurrent Continuous Group-Key Agreement. In 21st International Conference on Theory of Cryptography (Vol. 14371, pp. 271–300). Taipei, Taiwan: Springer Nature.https://doi.org/10.1007/978-3-031-48621-0_10 
LibreCat: https://research-explorer.ista.ac.at/record/14691
DOI: 10.1007/978-3-031-48621-0_10

Auerbach, B., Hoffmann, C., &; Pascual Perez, G. (2023). Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing. In 21st International Conference on Theory of Cryptography (Vol. 14371, pp. 301–330). Springer Nature.https://doi.org/10.1007/978-3-031-48621-0_11 
LibreCat: https://research-explorer.ista.ac.at/record/14692
DOI: 10.1007/978-3-031-48621-0_11

Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &; Yeo, M. X. (2023). : Boosting liquidity in payment channel networks with online admission control. In 27th International Conference on Financial Cryptography and Data Security (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature.https://doi.org/10.1007/978-3-031-47754-6_18 
LibreCat: https://research-explorer.ista.ac.at/record/14736
DOI: 10.1007/978-3-031-47754-6_18

Alwen, J., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., Pietrzak, K. Z., &; Walter, M. (2022). CoCoA: Concurrent continuous group key agreement. In Advances in Cryptology – EUROCRYPT 2022 (Vol. 13276, pp. 815–844). Cham: Springer Nature.https://doi.org/10.1007/978-3-031-07085-3_28 
LibreCat: https://research-explorer.ista.ac.at/record/11476
DOI: 10.1007/978-3-031-07085-3_28
WoS: 000832305300028

Bogdanov, A., Cueto Noval, M., Hoffmann, C., &; Rosen, A. (2022). Public-Key Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748, pp. 565–592). Chicago, IL, United States: Springer Nature.https://doi.org/10.1007/978-3-031-22365-5_20 
LibreCat: https://research-explorer.ista.ac.at/record/12516
DOI: 10.1007/978-3-031-22365-5_20
WoS: 000921318200020

Avarikioti, G., Pietrzak, K. Z., Salem, I., Schmid, S., Tiwari, S., &; Yeo, M. X. (2022). Hide &; Seek: Privacy-preserving rebalancing on payment channel networks. In Financial Cryptography and Data Security (Vol. 13411, pp. 358–373). Grenada: Springer Nature.https://doi.org/10.1007/978-3-031-18283-9_17 
LibreCat: https://research-explorer.ista.ac.at/record/12167
DOI: 10.1007/978-3-031-18283-9_17
arXiv: 2110.08848

Hoffmann, C., Hubádek, P., Kamath, C., Klein, K., &; Pietrzak, K. Z. (2022). Practical statistically-sound proofs of exponentiation in any group. In Advances in Cryptology – CRYPTO 2022 (Vol. 13508, pp. 370–399). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-031-15979-4_13 
LibreCat: https://research-explorer.ista.ac.at/record/12176
DOI: 10.1007/978-3-031-15979-4_13
WoS: 000886792700013

Walter, M. (2021). The convergence of slide-type reductions. In Public-Key Cryptography – PKC 2021 (Vol. 12710, pp. 45–67). Virtual: Springer Nature.https://doi.org/10.1007/978-3-030-75245-3_3 
LibreCat: https://research-explorer.ista.ac.at/record/9466
DOI: 10.1007/978-3-030-75245-3_3

Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., &; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In Topics in Cryptology – CT-RSA 2021 (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature.https://doi.org/10.1007/978-3-030-75539-3_17 
LibreCat: https://research-explorer.ista.ac.at/record/9826
DOI: 10.1007/978-3-030-75539-3_17

Laarhoven, T., &; Walter, M. (2021). Dual lattice attacks for closest vector problems (with preprocessing). In Topics in Cryptology – CT-RSA 2021 (Vol. 12704, pp. 478–502). Virtual Event: Springer Nature.https://doi.org/10.1007/978-3-030-75539-3_20 
LibreCat: https://research-explorer.ista.ac.at/record/9825
DOI: 10.1007/978-3-030-75539-3_20

Chakraborty, S., Dziembowski, S., Gazka, M., Lizurej, T., Pietrzak, K. Z., &; Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp. 397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_14 
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G.,https://doi.org/10.1007/978-3-030-90456-2_8__Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90456-2_8 
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th International Conference (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

Chakraborty, S., Ganesh, C., Pancholi, M., &; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In 27th International Conference on the Theory and Application of Cryptology and Information Security (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature.https://doi.org/10.1007/978-3-030-92075-3_12 
LibreCat: https://research-explorer.ista.ac.at/record/10609
DOI: 10.1007/978-3-030-92075-3_12
WoS: 000927876200012

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II  (Vol. 12826, pp. 486–515). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-84245-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10041
DOI: 10.1007/978-3-030-84245-1_17

Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M.,https://doi.org/10.1109/sp40001.2021.00035__Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy  (pp. 268–284). San Francisco, CA, United States: IEEE.https://doi.org/10.1109/sp40001.2021.00035 
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.
LibreCat: https://research-explorer.ista.ac.at/record/10044

Klein, K. (2021). On the adaptive security of graph-based games. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10035 
LibreCat: https://research-explorer.ista.ac.at/record/10035
DOI: 10.15479/at:ista:10035

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th International Conference (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_19 
LibreCat: https://research-explorer.ista.ac.at/record/10410
DOI: 10.1007/978-3-030-90453-1_19
WoS: 000728364000019

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.
LibreCat: https://research-explorer.ista.ac.at/record/10048

Pietrzak, K. Z., Salem, I., Schmid, S., &; Yeo, M. X. (2021). LightPIR: Privacy-preserving route discovery for payment channel networks. Presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland: IEEE.https://doi.org/10.23919/IFIPNetworking52078.2021.9472205 
LibreCat: https://research-explorer.ista.ac.at/record/9969
DOI: 10.23919/IFIPNetworking52078.2021.9472205
WoS: 000853016800008
arXiv: 2104.04293

Chakraborty, S., Dziembowski, S., &; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-56880-1_26 
LibreCat: https://research-explorer.ista.ac.at/record/8322
DOI: 10.1007/978-3-030-56880-1_26

Genise, N., Micciancio, D., Peikert, C., &; Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-030-45374-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/8339
DOI: 10.1007/978-3-030-45374-9_21

Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay attacks in private contact tracing. In Progress in Cryptology (Vol. 12578, pp. 3–15). Bangalore, India: Springer Nature.https://doi.org/10.1007/978-3-030-65277-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/8987
DOI: 10.1007/978-3-030-65277-7_1
WoS: 000927592800001

Auerbach, B., Giacon, F., &; Kiltz, E. (2020). Everybody’s a target: Scalability in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol. 12107, pp. 475–506). Springer Nature.https://doi.org/10.1007/978-3-030-45727-3_16 
LibreCat: https://research-explorer.ista.ac.at/record/7966
DOI: 10.1007/978-3-030-45727-3_16
WoS: 000828688000016

Kamath Hosdurg, C. (2020). On the average-case hardness of total search problems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:7896 
LibreCat: https://research-explorer.ista.ac.at/record/7896
DOI: 10.15479/AT:ISTA:7896

Demay, G., Gazi, P., Maurer, U., &; Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press.https://doi.org/10.3233/JCS-181131 
LibreCat: https://research-explorer.ista.ac.at/record/5887
DOI: 10.3233/JCS-181131

Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.60 
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, &; T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-23696-0_9 
LibreCat: https://research-explorer.ista.ac.at/record/6726
DOI: 10.1007/978-3-030-23696-0_9

Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In 2019 IEEE International Symposium on Information Theory. Paris, France: IEEE.https://doi.org/10.1109/isit.2019.8849240 
LibreCat: https://research-explorer.ista.ac.at/record/7136
DOI: 10.1109/isit.2019.8849240
WoS: 000489100301043
arXiv: 1702.08476

Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing.https://doi.org/10.1007/978-3-030-17656-3_10 
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Choudhuri, A. R., Hubádek, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., &; Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States: ACM Press.https://doi.org/10.1145/3313276.3316400 
LibreCat: https://research-explorer.ista.ac.at/record/6677
DOI: 10.1145/3313276.3316400
WoS: 000523199100100

Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2019). Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature.https://doi.org/10.1007/978-3-030-17259-6_11 
LibreCat: https://research-explorer.ista.ac.at/record/6430
DOI: 10.1007/978-3-030-17259-6_11

Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research.https://doi.org/10.13154/tches.v2018.i3.214-242 
LibreCat: https://research-explorer.ista.ac.at/record/10286
DOI: 10.13154/tches.v2018.i3.214-242

Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.59 
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:TH_1046 
LibreCat: https://research-explorer.ista.ac.at/record/83
DOI: 10.15479/AT:ISTA:TH_1046

Obremski, M., &; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE.https://doi.org/10.1109/ISIT.2018.8437654 
LibreCat: https://research-explorer.ista.ac.at/record/108
DOI: 10.1109/ISIT.2018.8437654
WoS: 000448139300368

Dziembowski, S., Pietrzak, K. Z., &; Wichs, D. (2018). Non-malleable codes. Journal of the ACM. ACM.https://doi.org/10.1145/3178432 
LibreCat: https://research-explorer.ista.ac.at/record/107
DOI: 10.1145/3178432
WoS: 000442938200004

Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z.,https://doi.org/10.1145/3196494.3196534__Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM.https://doi.org/10.1145/3196494.3196534 
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

Micciancio, D., &; Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78381-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Cohen, B., &; Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_15 
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_4 
LibreCat: https://research-explorer.ista.ac.at/record/298
DOI: 10.1007/978-3-319-78375-8_4
WoS: 000517098700004
arXiv: 1705.05313

Chatterjee, S., Kamath Hosdurg, C., &; Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS.https://doi.org/10.3934/amc.2018002 
LibreCat: https://research-explorer.ista.ac.at/record/5980
DOI: 10.3934/amc.2018002
WoS: 000430950400002

Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature.https://doi.org/10.1007/978-3-662-58387-6_26 
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Alwen, J. F., De Rezende, S., Nordstrom, J., &; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Brody, J., Dziembowski, S., Faust, S., &; Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai &; L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer.https://doi.org/10.1007/978-3-319-70500-2_3 
LibreCat: https://research-explorer.ista.ac.at/record/605
DOI: 10.1007/978-3-319-70500-2_3

Alwen, J. F., &; Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai &; L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer.https://doi.org/10.1007/978-3-319-70500-2_17 
LibreCat: https://research-explorer.ista.ac.at/record/609
DOI: 10.1007/978-3-319-70500-2_17

Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., &; Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_2 
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/10.1007/978-3-319-55911-7_43 
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/10.1007/978-3-319-55911-7_42 
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

Alwen, J. F., Blocki, J., &; Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press.https://doi.org/10.1145/3133956.3134031 
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031

Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE.https://doi.org/10.1109/isit.2017.8006529 
LibreCat: https://research-explorer.ista.ac.at/record/6526
DOI: 10.1109/isit.2017.8006529
arXiv: 1702.01666

Pietrzak, K. Z., &; Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2017.39 
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

Obremski, M., &; Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20 
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

Rybar, M. (2017). (The exact security of) Message authentication codes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:th_828 
LibreCat: https://research-explorer.ista.ac.at/record/838
DOI: 10.15479/AT:ISTA:th_828

Gazi, P., Pietrzak, K. Z., &; Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology. Ruhr University Bochum.https://doi.org/10.13154/TOSC.V2016.I2.145-161 
LibreCat: https://research-explorer.ista.ac.at/record/6196
DOI: 10.13154/TOSC.V2016.I2.145-161

Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &; Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer.https://doi.org/10.1007/978-3-319-70697-9_13 
LibreCat: https://research-explorer.ista.ac.at/record/559
DOI: 10.1007/978-3-319-70697-9_13

Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., &; Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &; H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-319-63688-7_5 
LibreCat: https://research-explorer.ista.ac.at/record/637
DOI: 10.1007/978-3-319-63688-7_5

Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2017.57 
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057

Alwen, J. F., &; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&;P: European Symposium on Security and Privacy, Paris, France: IEEE.https://doi.org/10.1109/EuroSP.2017.47 
LibreCat: https://research-explorer.ista.ac.at/record/1176
DOI: 10.1109/EuroSP.2017.47
WoS: 000424197300011

Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &; Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-016-9247-3 
LibreCat: https://research-explorer.ista.ac.at/record/1187
DOI: 10.1007/s00145-016-9247-3
WoS: 000410788600007

Kamath Hosdurg, C., &; Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. Springer.https://doi.org/10.1007/s00453-015-9997-6 
LibreCat: https://research-explorer.ista.ac.at/record/1177
DOI: 10.1007/s00453-015-9997-6

Pietrzak, K. Z., &; Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer.https://doi.org/10.1007/978-3-662-53641-4_8 
LibreCat: https://research-explorer.ista.ac.at/record/1179
DOI: 10.1007/978-3-662-53641-4_8

Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-662-49896-5_13 
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Fuchsbauer, G., Heuer, F., Kiltz, E., &; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-662-49096-9_12 
LibreCat: https://research-explorer.ista.ac.at/record/1233
DOI: 10.1007/978-3-662-49096-9_12

Alwen, J. F., &; Blocki, J. (2016). Efficiently computing data-independent memory-hard functions (Vol. 9815, pp. 241–271). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer.https://doi.org/10.1007/978-3-662-53008-5_9 
LibreCat: https://research-explorer.ista.ac.at/record/1365
DOI: 10.1007/978-3-662-53008-5_9

Gazi, P., &; Tessaro, S. (2016). Provably robust sponge-based PRNGs and KDFs (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-662-49890-3_4 
LibreCat: https://research-explorer.ista.ac.at/record/1366
DOI: 10.1007/978-3-662-49890-3_4

Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &; Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-014-9196-7 
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7

Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., &; Slamanig, D. (2016). Practical round-optimal blind signatures in the standard model from weaker assumptions (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer.https://doi.org/10.1007/978-3-319-44618-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/1225
DOI: 10.1007/978-3-319-44618-9_21

Okamoto, T., Pietrzak, K. Z., Waters, B., &; Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer.https://doi.org/10.1007/978-3-662-48797-6_6 
LibreCat: https://research-explorer.ista.ac.at/record/1653
DOI: 10.1007/978-3-662-48797-6_6

Krenn, S., Pietrzak, K. Z., Wadia, A., &; Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. Springer.https://doi.org/10.1007/s00037-015-0120-9 
LibreCat: https://research-explorer.ista.ac.at/record/1479
DOI: 10.1007/s00037-015-0120-9

Abusalah, H. M., Fuchsbauer, G., &; Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer.https://doi.org/10.1007/978-3-319-39555-5_16 
LibreCat: https://research-explorer.ista.ac.at/record/1229
DOI: 10.1007/978-3-319-39555-5_16

Abusalah, H. M., Fuchsbauer, G., &; Pietrzak, K. Z. (2016). Constrained PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA: Springer.https://doi.org/10.1007/978-3-319-29485-8_24 
LibreCat: https://research-explorer.ista.ac.at/record/1236
DOI: 10.1007/978-3-319-29485-8_24

Abusalah, H. M., &; Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer.https://doi.org/10.1007/978-3-319-39555-5_24 
LibreCat: https://research-explorer.ista.ac.at/record/1235
DOI: 10.1007/978-3-319-39555-5_24

Ferrara, A., Fuchsbauer, G., Liu, B., &; Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE.https://doi.org/10.1109/CSF.2015.11 
LibreCat: https://research-explorer.ista.ac.at/record/1474
DOI: 10.1109/CSF.2015.11

Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., &; Stevens, S. (2015). Key-homomorphic constrained pseudorandom functions. In 12th Theory of Cryptography Conference (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer Nature.https://doi.org/10.1007/978-3-662-46497-7_2 
LibreCat: https://research-explorer.ista.ac.at/record/1646
DOI: 10.1007/978-3-662-46497-7_2

Fuchsbauer, G., Jafargholi, Z., &; Pietrzak, K. Z. (2015). A quasipolynomial reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer.https://doi.org/10.1007/978-3-662-47989-6_29 
LibreCat: https://research-explorer.ista.ac.at/record/1648
DOI: 10.1007/978-3-662-47989-6_29

Benhamouda, F., Krenn, S., Lyubashevsky, V., &; Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-24174-6_16 
LibreCat: https://research-explorer.ista.ac.at/record/1649
DOI: 10.1007/978-3-319-24174-6_16

Demay, G., Gazi, P., Maurer, U., &; Tackmann, B. (2015). Query-complexity amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland: Springer.https://doi.org/10.1007/978-3-319-17470-9_10 
LibreCat: https://research-explorer.ista.ac.at/record/1644
DOI: 10.1007/978-3-319-17470-9_10

Fuchsbauer, G., Hanser, C., &; Slamanig, D. (2015). Practical round-optimal blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_12 
LibreCat: https://research-explorer.ista.ac.at/record/1647
DOI: 10.1007/978-3-662-48000-7_12

Gazi, P., &; Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In 2015 IEEE Information Theory Workshop. Jerusalem, Israel: IEEE.https://doi.org/10.1109/ITW.2015.7133163 
LibreCat: https://research-explorer.ista.ac.at/record/1645
DOI: 10.1109/ITW.2015.7133163

Gazi, P., Pietrzak, K. Z., &; Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer.https://doi.org/10.1007/978-3-662-48800-3_4 
LibreCat: https://research-explorer.ista.ac.at/record/1654
DOI: 10.1007/978-3-662-48800-3_4

Skórski, M., Golovnev, A., &; Pietrzak, K. Z. (2015). Condensed unpredictabilityhttps://doi.org/10.1007/978-3-662-47672-7_85__(Vol. 9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer.https://doi.org/10.1007/978-3-662-47672-7_85 
LibreCat: https://research-explorer.ista.ac.at/record/1650
DOI: 10.1007/978-3-662-47672-7_85

Baldimtsi, F., Chase, M., Fuchsbauer, G., &; Kohlweiss, M. (2015). Anonymous transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer.https://doi.org/10.1007/978-3-662-46447-2_5 
LibreCat: https://research-explorer.ista.ac.at/record/1651
DOI: 10.1007/978-3-662-46447-2_5

Alwen, J. F., &; Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In Proceedings of the 47th annual ACM symposium on Theory of computing (pp. 595–603). Portland, OR, United States: ACM.https://doi.org/10.1145/2746539.2746622 
LibreCat: https://research-explorer.ista.ac.at/record/1652
DOI: 10.1145/2746539.2746622

Alwen, J. F., Ostrovsky, R., Zhou, H., &; Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_37 
LibreCat: https://research-explorer.ista.ac.at/record/1672
DOI: 10.1007/978-3-662-48000-7_37

Pietrzak, K. Z., &; Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer.https://doi.org/10.1007/978-3-319-22174-8_5 
LibreCat: https://research-explorer.ista.ac.at/record/1669
DOI: 10.1007/978-3-319-22174-8_5

Gazi, P., Pietrzak, K. Z., &; Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-47989-6_18 
LibreCat: https://research-explorer.ista.ac.at/record/1671
DOI: 10.1007/978-3-662-47989-6_18

Gazi, P., Lee, J., Seurin, Y., Steinberger, J., &; Tessaro, S. (2015). Relaxing full-codebook security: A refined analysis of key-length extension schemes. Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer.https://doi.org/10.1007/978-3-662-48116-5_16 
LibreCat: https://research-explorer.ista.ac.at/record/1668
DOI: 10.1007/978-3-662-48116-5_16