Teaching Old Crypto New Tricks

Project Period: 2016-04-01 – 2021-03-31
Externally Funded
Acronym
TOCNeT
Principal Investigator
Krzysztof Z Pietrzak
Department(s)
Pietrzak Group
Grant Number
682815
Funding Organisation
EC/H2020

30 Publications

2019 | Journal Article | IST-REx-ID: 5887
Per-session security: Password-based cryptography revisited
G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.
View | DOI
 
2018 | Thesis | IST-REx-ID: 83   OA
Proof systems for sustainable decentralized cryptocurrencies
H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, IST Austria, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 302   OA
Simple proofs of sequential work
B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 605   OA
Position based cryptography and multiparty communication complexity
J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6527   OA
Practical graphs for optimal side-channel resistant memory-hard functions
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1229
Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 559
Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
View | Files available | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1174   OA
Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1179   OA
Pseudoentropy: Lower-bounds for chain rules and transformations
K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 637   OA
Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
View | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6528   OA
Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
View | Files available | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 6941   OA
SpaceMint: A cryptocurrency based on proofs of space
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1225
Practical round-optimal blind signatures in the standard model from weaker assumptions
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.
View | Files available | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 107
Non-malleable codes
S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6430
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 640   OA
Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
View | DOI | Download (ext.)
 
2019 | Book Chapter | IST-REx-ID: 6726
Sampling the integers with low relative error
M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 710   OA
Renyi entropy estimation revisited
M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 7407   OA
Proofs of catalytic space
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
View | Files available | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1187   OA
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 635   OA
Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6526   OA
On the complexity of estimating Rènyi divergences
M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.
View | DOI | Download (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 697   OA
Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 6196
The exact security of PMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1235
Constrained PRFs for unbounded inputs with short keys
H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 7411   OA
Reversible proofs of sequential work
H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 298   OA
Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
View | DOI | Download (ext.) | arXiv
 
2020 | Thesis | IST-REx-ID: 7896   OA
On the average-case hardness of total search problems
C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, IST Austria, 2020.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6677
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–1114.
View | Files available | DOI