Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




92 Publications

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
 
2020 | Conference Paper | IST-REx-ID: 7966   OA
Everybody’s a target: Scalability in public-key encryption
B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT 2020, Springer Nature, 2020, pp. 475–506.
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.)
 
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
 
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
 
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
 
2019 | Conference Paper | IST-REx-ID: 7136   OA
Strong chain rules for min-entropy under few bits spoiled
M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019.
View | DOI | Download (ext.) | arXiv
 
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.)
 
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
 
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.)
 
2018 | Journal Article | IST-REx-ID: 5980
Private set-intersection with common set-up
S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.
View | DOI
 
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.)
 
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
 
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.)
 
2018 | Conference Paper | IST-REx-ID: 108   OA
Inverted leftover hash lemma
M. Obremski, M. Skorski, in:, IEEE, 2018.
View | DOI | Download (ext.)
 
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: 300   OA
On the bit security of cryptographic primitives
D. Micciancio, M. Walter, in:, M. Walter (Ed.), Springer, 2018, pp. 3–28.
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
 
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: 648   OA
On the complexity of breaking pseudoentropy
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 650   OA
A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.
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.)
 
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 | Thesis | IST-REx-ID: 838   OA
(The exact security of) Message authentication codes
M. Rybar, (The Exact Security of) Message Authentication Codes, IST Austria, 2017.
View | Files available | DOI
 
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.)
 
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.)
 
2017 | Conference Paper | IST-REx-ID: 1175   OA
Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
View | Files available | 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.)
 
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
 
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: 1176   OA
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 609   OA
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
View | DOI | Download (ext.)
 
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: 1231   OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
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
 
2016 | Conference Paper | IST-REx-ID: 1236
Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
View | Files available | DOI
 
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.)
 
2016 | Journal Article | IST-REx-ID: 1592
Structure preserving signatures and commitments to group elements
M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology 29 (2016) 363–421.
View | DOI
 
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.)
 
2016 | Conference Paper | IST-REx-ID: 1233   OA
Standard security does imply security against selective opening for markov distributions
G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1365   OA
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1366   OA
Provably robust sponge-based PRNGs and KDFs
P. Gazi, S. Tessaro, in:, Springer, 2016, pp. 87–116.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1479
A counterexample to the chain rule for conditional HILL entropy
S. Krenn, K.Z. Pietrzak, A. Wadia, D. Wichs, Computational Complexity 25 (2016) 567–605.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1177   OA
A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1653   OA
New realizations of somewhere statistically binding hashing and positional accumulators
T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.
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.)
 

Search

Filter Publications

Display / Sort

Export / Embed