D. Micciancio and M. Walter, “On the bit security of cryptographic primitives,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10820, pp. 3–28.
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.
LibreCat: https://research-explorer.ista.ac.at/record/298
DOI: 10.1007/978-3-319-78375-8_4
WoS: 000517098700004
arXiv: 1705.05313

S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5980
DOI: 10.3934/amc.2018002
WoS: 000430950400002

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

J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.
LibreCat: https://research-explorer.ista.ac.at/record/605
DOI: 10.1007/978-3-319-70500-2_3

J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526.
LibreCat: https://research-explorer.ista.ac.at/record/609
DOI: 10.1007/978-3-319-70500-2_17

J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

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

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

K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81.
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

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

P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/6196
DOI: 10.13154/TOSC.V2016.I2.145-161

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

Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.
LibreCat: https://research-explorer.ista.ac.at/record/637
DOI: 10.1007/978-3-319-63688-7_5

M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057

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

E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/1187
DOI: 10.1007/s00145-016-9247-3
WoS: 000410788600007

C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” Algorithmica, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1177
DOI: 10.1007/s00453-015-9997-6

K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.
LibreCat: https://research-explorer.ista.ac.at/record/1179
DOI: 10.1007/978-3-662-53641-4_8

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

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

J. F. Alwen and J. Blocki, “Efficiently computing data-independent memory-hard functions,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2016, vol. 9815, pp. 241–271.
LibreCat: https://research-explorer.ista.ac.at/record/1365
DOI: 10.1007/978-3-662-53008-5_9

P. Gazi and S. Tessaro, “Provably robust sponge-based PRNGs and KDFs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9665, pp. 87–116.
LibreCat: https://research-explorer.ista.ac.at/record/1366
DOI: 10.1007/978-3-662-49890-3_4

M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure preserving signatures and commitments to group elements,” Journal of Cryptology, vol. 29, no. 2. Springer, pp. 363–421, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7

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

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

S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3. Springer, pp. 567–605, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1479
DOI: 10.1007/s00037-015-0120-9

H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.
LibreCat: https://research-explorer.ista.ac.at/record/1229
DOI: 10.1007/978-3-319-39555-5_16

H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.
LibreCat: https://research-explorer.ista.ac.at/record/1236
DOI: 10.1007/978-3-319-29485-8_24

H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463.
LibreCat: https://research-explorer.ista.ac.at/record/1235
DOI: 10.1007/978-3-319-39555-5_24

A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic access control,” presented at the CSF: Computer Security Foundations, Verona, Italy, 2015, pp. 46–60.
LibreCat: https://research-explorer.ista.ac.at/record/1474
DOI: 10.1109/CSF.2015.11

A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” in 12th Theory of Cryptography Conference, Warsaw, Poland, 2015, vol. 9015, pp. 31–60.
LibreCat: https://research-explorer.ista.ac.at/record/1646
DOI: 10.1007/978-3-662-46497-7_2

G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.
LibreCat: https://research-explorer.ista.ac.at/record/1648
DOI: 10.1007/978-3-662-47989-6_29

F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1649
DOI: 10.1007/978-3-319-24174-6_16

G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Query-complexity amplification for random oracles,” presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland, 2015, vol. 9063, pp. 159–180.
LibreCat: https://research-explorer.ista.ac.at/record/1644
DOI: 10.1007/978-3-319-17470-9_10

G. Fuchsbauer, C. Hanser, and D. Slamanig, “Practical round-optimal blind signatures in the standard model,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 233–253.
LibreCat: https://research-explorer.ista.ac.at/record/1647
DOI: 10.1007/978-3-662-48000-7_12

P. Gazi and S. Tessaro, “Secret-key cryptography from ideal primitives: A systematic verview,” in 2015 IEEE Information Theory Workshop, Jerusalem, Israel, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1645
DOI: 10.1109/ITW.2015.7133163

P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1654
DOI: 10.1007/978-3-662-48800-3_4

M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.
LibreCat: https://research-explorer.ista.ac.at/record/1650
DOI: 10.1007/978-3-662-47672-7_85

F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable e-cash,” in Public-Key Cryptography - PKC 2015, Gaithersburg, MD, United States, 2015, vol. 9020, pp. 101–124.
LibreCat: https://research-explorer.ista.ac.at/record/1651
DOI: 10.1007/978-3-662-46447-2_5

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

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

K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1669
DOI: 10.1007/978-3-319-22174-8_5

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

P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook security: A refined analysis of key-length extension schemes,” vol. 9054. Springer, pp. 319–341, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1668
DOI: 10.1007/978-3-662-48116-5_16

S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in SCN 2014, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.
LibreCat: https://research-explorer.ista.ac.at/record/1643
DOI: 10.1007/978-3-319-10879-7_7

G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Optimality of non-adaptive strategies: The case of parallel games,” in IEEE International Symposium on Information Theory, Honolulu, USA, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1907
DOI: 10.1109/ISIT.2014.6875125

D. Dachman Soled, G. Fuchsbauer, P. Mohassel, and A. O’Neill, “Enhanced chosen-ciphertext security and applications,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol. 8383, pp. 329–344.
LibreCat: https://research-explorer.ista.ac.at/record/2045
DOI: 10.1007/978-3-642-54631-0_19

F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Ibiza, Spain, 2014, vol. 8744, pp. 170–184.
LibreCat: https://research-explorer.ista.ac.at/record/2047
DOI: 10.1007/978-3-319-11257-2_14
arXiv: 1407.8067

M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol. 8383, pp. 520–537.
LibreCat: https://research-explorer.ista.ac.at/record/2046
DOI: 10.1007/978-3-642-54631-0_30

Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.
LibreCat: https://research-explorer.ista.ac.at/record/2185
DOI: 10.1007/978-3-642-55220-5_6

E. Kiltz, D. Masny, and K. Z. Pietrzak, “Simple chosen-ciphertext security from low noise LPN,” presented at the IACR: International Conference on Practice and Theory in Public-Key Cryptography, 2014, vol. 8383, pp. 1–18.
LibreCat: https://research-explorer.ista.ac.at/record/2219
DOI: 10.1007/978-3-642-54631-0_1

D. Jetchev and K. Z. Pietrzak, “How to fake auxiliary input,” presented at the TCC: Theory of Cryptography Conference, San Diego, USA, 2014, vol. 8349, pp. 566–590.
LibreCat: https://research-explorer.ista.ac.at/record/2236
DOI: 10.1007/978-3-642-54242-8_24

M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp. 397–428, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2852
DOI: 10.1007/s00145-013-9148-7

P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.
LibreCat: https://research-explorer.ista.ac.at/record/2082
DOI: 10.1007/978-3-662-44371-2_7

J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2259
DOI: 10.1007/978-3-642-40041-4_4

E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2258
DOI: 10.1007/978-3-642-40041-4_31

D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2260
DOI: 10.1007/978-3-642-38980-1_33

A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.
LibreCat: https://research-explorer.ista.ac.at/record/2291
DOI: 10.1109/CSF.2013.15

S. Krenn, K. Z. Pietrzak, and A. Wadia, “A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it,” presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan, 2013, vol. 7785, pp. 23–39.
LibreCat: https://research-explorer.ista.ac.at/record/2940
DOI: 10.1007/978-3-642-36594-2_2

O. Blazy, G. Fuchsbauer, D. Pointcheval, and D. Vergnaud, “Short blind signatures,” Journal of Computer Security, vol. 21, no. 5. IOS Press, pp. 627–661, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/502
DOI: 10.3233/JCS-130477

S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2274

S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in  Conference proceedings CHES 2012, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.
LibreCat: https://research-explorer.ista.ac.at/record/2048
DOI: 10.1007/978-3-642-33027-8_13

S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in  Conference proceedings FSE 2012, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.
LibreCat: https://research-explorer.ista.ac.at/record/2049
DOI: 10.1007/978-3-642-34047-5_20

J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in Proceedings of the 2012 ACM conference on Computer and communications security, Raleigh, NC, USA, 2012, pp. 488–500.
LibreCat: https://research-explorer.ista.ac.at/record/2937
DOI: 10.1145/2382196.2382249

A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.
LibreCat: https://research-explorer.ista.ac.at/record/2974
DOI: 10.1007/978-3-642-34961-4_40

K. Z. Pietrzak, “Cryptography from learning parity with noise,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Spindlerfv Mlýn, Czech Republic, 2012, vol. 7147, pp. 99–114.
LibreCat: https://research-explorer.ista.ac.at/record/3250
DOI: 10.1007/978-3-642-27660-6_9

Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication, revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.
LibreCat: https://research-explorer.ista.ac.at/record/3282
DOI: 10.1007/978-3-642-29011-4_22

K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.
LibreCat: https://research-explorer.ista.ac.at/record/3280
DOI: 10.1007/978-3-642-28914-9_31

K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 458–475.
LibreCat: https://research-explorer.ista.ac.at/record/3281
DOI: 10.1007/978-3-642-28914-9_26

A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.
LibreCat: https://research-explorer.ista.ac.at/record/3279
DOI: 10.1007/978-3-642-28914-9_21