Trojan-resilience without cryptography
S. Chakraborty, S. Dziembowski, M. Gazka, T. Lizurej, K.Z. Pietrzak, M.X. Yeo, in:, Springer Nature, 2021, pp. 397–428.
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Grafting key trees: Efficient key management for overlapping groups
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

On treewidth, separators and Yao’s garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference, Springer Nature, 2021, pp. 486–517.
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

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

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

Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

On treewidth, separators and Yao's garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10044

On the adaptive security of graph-based games
K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10035
DOI: 10.15479/at:ista:10035

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

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

LightPIR: Privacy-preserving route discovery for payment channel networks
K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/9969
DOI: 10.23919/IFIPNetworking52078.2021.9472205
WoS: 000853016800008
arXiv: 2104.04293

Reverse firewalls for actively secure MPCs
S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.
LibreCat: https://research-explorer.ista.ac.at/record/8322
DOI: 10.1007/978-3-030-56880-1_26

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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/7966
DOI: 10.1007/978-3-030-45727-3_16
WoS: 000828688000016

On the average-case hardness of total search problems
C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/7896
DOI: 10.15479/AT:ISTA:7896

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

Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

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.
LibreCat: https://research-explorer.ista.ac.at/record/6726
DOI: 10.1007/978-3-030-23696-0_9

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubádek, 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.
LibreCat: https://research-explorer.ista.ac.at/record/6677
DOI: 10.1145/3313276.3316400
WoS: 000523199100100

Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
LibreCat: https://research-explorer.ista.ac.at/record/6430
DOI: 10.1007/978-3-030-17259-6_11

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

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

Inverted leftover hash lemma
M. Obremski, M. Skórski, in:, IEEE, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/108
DOI: 10.1109/ISIT.2018.8437654
WoS: 000448139300368

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

On the bit security of cryptographic primitives
D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Simple proofs of sequential work
B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, 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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

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.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

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.
LibreCat: https://research-explorer.ista.ac.at/record/605
DOI: 10.1007/978-3-319-70500-2_3

Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
LibreCat: https://research-explorer.ista.ac.at/record/609
DOI: 10.1007/978-3-319-70500-2_17

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.
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

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.
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

On the complexity of breaking pseudoentropy
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

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.
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

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.
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031

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

Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

Renyi entropy estimation revisited
M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

(The exact security of) Message authentication codes
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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/559
DOI: 10.1007/978-3-319-70697-9_13

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.
LibreCat: https://research-explorer.ista.ac.at/record/637
DOI: 10.1007/978-3-319-63688-7_5

Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057

Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/1176
DOI: 10.1109/EuroSP.2017.47
WoS: 000424197300011

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

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

Pseudoentropy: Lower-bounds for chain rules and transformations
K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.
LibreCat: https://research-explorer.ista.ac.at/record/1179
DOI: 10.1007/978-3-662-53641-4_8

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.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

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.
LibreCat: https://research-explorer.ista.ac.at/record/1233
DOI: 10.1007/978-3-662-49096-9_12

Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
LibreCat: https://research-explorer.ista.ac.at/record/1365
DOI: 10.1007/978-3-662-53008-5_9

Provably robust sponge-based PRNGs and KDFs
P. Gazi, S. Tessaro, in:, Springer, 2016, pp. 87–116.
LibreCat: https://research-explorer.ista.ac.at/record/1366
DOI: 10.1007/978-3-662-49890-3_4

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.
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7

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.
LibreCat: https://research-explorer.ista.ac.at/record/1225
DOI: 10.1007/978-3-319-44618-9_21

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.
LibreCat: https://research-explorer.ista.ac.at/record/1653
DOI: 10.1007/978-3-662-48797-6_6

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.
LibreCat: https://research-explorer.ista.ac.at/record/1479
DOI: 10.1007/s00037-015-0120-9

Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
LibreCat: https://research-explorer.ista.ac.at/record/1229
DOI: 10.1007/978-3-319-39555-5_16

Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
LibreCat: https://research-explorer.ista.ac.at/record/1236
DOI: 10.1007/978-3-319-29485-8_24

Constrained PRFs for unbounded inputs with short keys
H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.
LibreCat: https://research-explorer.ista.ac.at/record/1235
DOI: 10.1007/978-3-319-39555-5_24

Policy privacy in cryptographic access control
A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.
LibreCat: https://research-explorer.ista.ac.at/record/1474
DOI: 10.1109/CSF.2015.11

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

A quasipolynomial reduction for generalized selective decryption on trees
G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.
LibreCat: https://research-explorer.ista.ac.at/record/1648
DOI: 10.1007/978-3-662-47989-6_29

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

Query-complexity amplification for random oracles
G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, Springer, 2015, pp. 159–180.
LibreCat: https://research-explorer.ista.ac.at/record/1644
DOI: 10.1007/978-3-319-17470-9_10

Practical round-optimal blind signatures in the standard model
G. Fuchsbauer, C. Hanser, D. Slamanig, in:, Springer, 2015, pp. 233–253.
LibreCat: https://research-explorer.ista.ac.at/record/1647
DOI: 10.1007/978-3-662-48000-7_12

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

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

Condensed unpredictability 
M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.
LibreCat: https://research-explorer.ista.ac.at/record/1650
DOI: 10.1007/978-3-662-47672-7_85

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

High parallel complexity graphs and memory-hard functions
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.
LibreCat: https://research-explorer.ista.ac.at/record/1652
DOI: 10.1145/2746539.2746622

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

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

The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC
P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.
LibreCat: https://research-explorer.ista.ac.at/record/1671
DOI: 10.1007/978-3-662-47989-6_18

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

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

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

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

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

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

Policy-based signatures
M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 520–537.
LibreCat: https://research-explorer.ista.ac.at/record/2046
DOI: 10.1007/978-3-642-54631-0_30

Key derivation without entropy waste
Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.
LibreCat: https://research-explorer.ista.ac.at/record/2185
DOI: 10.1007/978-3-642-55220-5_6

Simple chosen-ciphertext security from low noise LPN
E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.
LibreCat: https://research-explorer.ista.ac.at/record/2219
DOI: 10.1007/978-3-642-54631-0_1

How to fake auxiliary input
D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.
LibreCat: https://research-explorer.ista.ac.at/record/2236
DOI: 10.1007/978-3-642-54242-8_24

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

The exact PRF-security of NMAC and HMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.
LibreCat: https://research-explorer.ista.ac.at/record/2082
DOI: 10.1007/978-3-662-44371-2_7

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

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

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

Cryptographically enforced RBAC
A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.
LibreCat: https://research-explorer.ista.ac.at/record/2291
DOI: 10.1109/CSF.2013.15

A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it
S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.
LibreCat: https://research-explorer.ista.ac.at/record/2940
DOI: 10.1007/978-3-642-36594-2_2

Short blind signatures
O. Blazy, G. Fuchsbauer, D. Pointcheval, D. Vergnaud, Journal of Computer Security 21 (2013) 627–661.
LibreCat: https://research-explorer.ista.ac.at/record/502
DOI: 10.3233/JCS-130477

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

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

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