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

Dziembowski, S., Faust, S., Kolmogorov, V., &; Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_29 
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &; R. De Prisco (Eds.), SCN 2014 (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer.https://doi.org/10.1007/978-3-319-10879-7_7 
LibreCat: https://research-explorer.ista.ac.at/record/1643
DOI: 10.1007/978-3-319-10879-7_7

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

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

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

Bellare, M., &; Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383, pp. 520–537). Buenos Aires, Argentina: Springer.https://doi.org/10.1007/978-3-642-54631-0_30 
LibreCat: https://research-explorer.ista.ac.at/record/2046
DOI: 10.1007/978-3-642-54631-0_30

Dodis, Y., Pietrzak, K. Z., &; Wichs, D. (2014). Key derivation without entropy waste. In P. Nguyen &; E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-642-55220-5_6 
LibreCat: https://research-explorer.ista.ac.at/record/2185
DOI: 10.1007/978-3-642-55220-5_6

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

Jetchev, D., &; Pietrzak, K. Z. (2014). How to fake auxiliary input. In Y. Lindell (Ed.) (Vol. 8349, pp. 566–590). Presented at the TCC: Theory of Cryptography Conference, San Diego, USA: Springer.https://doi.org/10.1007/978-3-642-54242-8_24 
LibreCat: https://research-explorer.ista.ac.at/record/2236
DOI: 10.1007/978-3-642-54242-8_24

Fischlin, M., Lehmann, A., &; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-013-9148-7 
LibreCat: https://research-explorer.ista.ac.at/record/2852
DOI: 10.1007/s00145-013-9148-7

Gazi, P., Pietrzak, K. Z., &; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer.https://doi.org/10.1007/978-3-662-44371-2_7 
LibreCat: https://research-explorer.ista.ac.at/record/2082
DOI: 10.1007/978-3-662-44371-2_7

Alwen, J. F., Krenn, S., Pietrzak, K. Z., &; Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-642-40041-4_4 
LibreCat: https://research-explorer.ista.ac.at/record/2259
DOI: 10.1007/978-3-642-40041-4_4

Kiltz, E., Pietrzak, K. Z., &; Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-642-40041-4_31 
LibreCat: https://research-explorer.ista.ac.at/record/2258
DOI: 10.1007/978-3-642-40041-4_31

Bernhard, D., Fuchsbauer, G., &; Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer.https://doi.org/10.1007/978-3-642-38980-1_33 
LibreCat: https://research-explorer.ista.ac.at/record/2260
DOI: 10.1007/978-3-642-38980-1_33

Ferrara, A., Fuchsbauer, G., &; Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE.https://doi.org/10.1109/CSF.2013.15 
LibreCat: https://research-explorer.ista.ac.at/record/2291
DOI: 10.1109/CSF.2013.15

Krenn, S., Pietrzak, K. Z., &; Wadia, A. (2013). A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In A. Sahai (Ed.) (Vol. 7785, pp. 23–39). Presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan: Springer.https://doi.org/10.1007/978-3-642-36594-2_2 
LibreCat: https://research-explorer.ista.ac.at/record/2940
DOI: 10.1007/978-3-642-36594-2_2

Blazy, O., Fuchsbauer, G., Pointcheval, D., &; Vergnaud, D. (2013). Short blind signatures. Journal of Computer Security. IOS Press.https://doi.org/10.3233/JCS-130477 
LibreCat: https://research-explorer.ista.ac.at/record/502
DOI: 10.3233/JCS-130477

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

Faust, S., Pietrzak, K. Z., &; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In https://doi.org/10.1007/978-3-642-33027-8_13__Conference proceedings CHES 2012 (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer.https://doi.org/10.1007/978-3-642-33027-8_13 
LibreCat: https://research-explorer.ista.ac.at/record/2048
DOI: 10.1007/978-3-642-33027-8_13

Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In https://doi.org/10.1007/978-3-642-34047-5_20__Conference proceedings FSE 2012 (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer.https://doi.org/10.1007/978-3-642-34047-5_20 
LibreCat: https://research-explorer.ista.ac.at/record/2049
DOI: 10.1007/978-3-642-34047-5_20

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

Jain, A., Krenn, S., Pietrzak, K. Z., &; Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang &; K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer.https://doi.org/10.1007/978-3-642-34961-4_40 
LibreCat: https://research-explorer.ista.ac.at/record/2974
DOI: 10.1007/978-3-642-34961-4_40

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

Dodis, Y., Pietrzak, K. Z., Kiltz, E., &; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer.https://doi.org/10.1007/978-3-642-29011-4_22 
LibreCat: https://research-explorer.ista.ac.at/record/3282
DOI: 10.1007/978-3-642-29011-4_22

Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_31 
LibreCat: https://research-explorer.ista.ac.at/record/3280
DOI: 10.1007/978-3-642-28914-9_31

Pietrzak, K. Z., Rosen, A., &; Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_26 
LibreCat: https://research-explorer.ista.ac.at/record/3281
DOI: 10.1007/978-3-642-28914-9_26

Jain, A., Pietrzak, K. Z., &; Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/3279
DOI: 10.1007/978-3-642-28914-9_21