83 Publications

Mark all

[83]
2019 | Conference Paper | IST-REx-ID: 6528   OA
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124. 60.
View | Files available | DOI | Download (ext.)
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443. 317–346.
View | DOI
 
[81]
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing 1103–1114.
View | DOI
 
[80]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 302   OA
Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821. 451–467.
View | DOI | Download (ext.)
 
[78]
2018 | Conference Paper | IST-REx-ID: 6941   OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957. 480–499.
View | DOI | Download (ext.)
 
[77]
2018 | Journal Article | IST-REx-ID: 107
Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4).
View | DOI
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction for generalized selective decryption on trees. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP: Automata, Languages and Programming, LNCS, vol. 9134. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic constrained pseudorandom functions. 9015, 31–60.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
Fuchsbauer G, Konstantinov M, Pietrzak KZ, Rao V. 2014. Adaptive security of constrained PRFs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 8874. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2236   OA
Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349. 566–590.
View | Files available | DOI | Download (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441. 93–110.
View | Files available | DOI
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
Krenn S, Pietrzak KZ, Wadia A. 2013. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. TCC: Theory of Cryptography Conference, LNCS, vol. 7785. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3250
Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147. 99–114.
View | DOI
 
[35]
2012 | Conference Paper | IST-REx-ID: 3279
Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 369–382.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3281
Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 458–475.
View | DOI | Download (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Barak B, Dodis Y, Krawczyk H, Pereira O, Pietrzak KZ, Standaert F, Yu Y. 2011. Leftover hash lemma revisited. CRYPTO: International Cryptology Conference, LNCS, vol. 6841. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
Faust S, Pietrzak KZ, Venturi D. 2011. Tamper proof circuits How to trade leakage for tamper resilience. ICALP: Automata, Languages and Programming, LNCS, vol. 6755. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
Jain A, Pietrzak KZ. 2011. Parallel repetition for leakage resilience amplification revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 6597. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Kiltz E, Pietrzak KZ. 2010. Leakage resilient ElGamal encryption. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 6477. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures. TCC: Theory of Cryptography Conference, LNCS, vol. 5978. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Dodis Y, Pietrzak KZ. 2010. Leakage resilient pseudorandom functions and side channel attacks on feistel networks. CRYPTO: International Cryptology Conference, LNCS, vol. 6223. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
Pietrzak KZ. 2009. A leakage resilient mode of operation. CRYPTO: International Cryptology Conference, LNCS, vol. 5479. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
Kiltz E, Pietrzak KZ, Stam M, Yung M. 2009. A new randomness extraction paradigm for hybrid encryption. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 5479. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
Kiltz E, Pietrzak KZ. 2009. On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 5479. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
Fischlin M, Lehmann A, Pietrzak KZ. 2008. Robust multi property combiners for hash functions revisited. ICALP: Automata, Languages and Programming, LNCS, vol. 5126. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
Pietrzak KZ, Sjödin J. 2008. Weak pseudorandom functions in minicrypt. ICALP: Automata, Languages and Programming, LNCS, vol. 5126. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. 2008. Elektrowiz – system of measurement data management. Przeglad Elektrotechniczny. 84(10), 239–242.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
Pietrzak KZ. 2008. Compression from collisions or why CRHF combiners have a long output. CRYPTO: International Cryptology Conference, LNCS, vol. 5157. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Dodis Y, Pietrzak KZ, Puniya P. 2008. A new mode of operation for block ciphers and length preserving MACs. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4965. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
Dziembowski S, Pietrzak KZ. 2008. Leakage resilient cryptography. FOCS: Foundations of Computer Science 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Pietrzak KZ. 2007. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
Dziembowski S, Pietrzak KZ. 2007. Intrusion resilient secret sharing. FOCS: Foundations of Computer Science 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
Maurer U, Pietrzak KZ, Renner R. 2007. Indistinguishability amplification. CRYPTO: International Cryptology Conference, LNCS, vol. 4622. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
Pietrzak KZ, Sjödin J. 2007. Range extension for weak PRFs the good the bad and the ugly. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
Pietrzak KZ, Wikström D. 2007. Parallel repetition of computationally sound protocols revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 4392. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Dodis Y, Pietrzak KZ. 2007. Improving the security of MACs via randomized message preprocessing. FSE: Fast Software Encryption, LNCS, vol. 4593. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Maurer U, Oswald Y, Pietrzak KZ, Sjödin J. 2006. Luby Rackoff ciphers from weak round functions . EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Dodis Y, Pietrzak KZ, Przydatek B. 2006. Separating sources for encryption and secret sharing. TCC: Theory of Cryptography Conference, LNCS, vol. 3876. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
Pietrzak KZ. 2006. A tight bound for EMAC. ICALP: Automata, Languages and Programming, LNCS, vol. 4052. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
Pietrzak KZ. 2006. Composition implies adaptive security in minicrypt. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
Pietrzak KZ. 2005. Composition does not imply adaptive security. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
Bellare M, Pietrzak KZ, Rogaway P. 2005. Improved security analyses for CBC MACs. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
Dodis Y, Oliveira R, Pietrzak KZ. 2005. On the generic insecurity of the full domain hash. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed

83 Publications

Mark all

[83]
2019 | Conference Paper | IST-REx-ID: 6528   OA
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124. 60.
View | Files available | DOI | Download (ext.)
 
[82]
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443. 317–346.
View | DOI
 
[81]
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing 1103–1114.
View | DOI
 
[80]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
[79]
2018 | Conference Paper | IST-REx-ID: 302   OA
Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821. 451–467.
View | DOI | Download (ext.)
 
[78]
2018 | Conference Paper | IST-REx-ID: 6941   OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957. 480–499.
View | DOI | Download (ext.)
 
[77]
2018 | Journal Article | IST-REx-ID: 107
Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4).
View | DOI
 
[76]
2018 | Conference Paper | IST-REx-ID: 298   OA
Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821. 99–130.
View | DOI | Download (ext.)
 
[75]
2017 | Conference Paper | IST-REx-ID: 605   OA
Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677. 56–81.
View | DOI | Download (ext.)
 
[74]
2017 | Conference Paper | IST-REx-ID: 559
Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625. 357–379.
View | Files available | DOI | Download (ext.)
 
[73]
2017 | Conference Paper | IST-REx-ID: 637   OA
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401. 133–163.
View | DOI | Download (ext.)
 
[72]
2017 | Journal Article | IST-REx-ID: 1187
Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.
View | Files available | DOI
 
[71]
2017 | Conference Paper | IST-REx-ID: 640   OA
Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 3–32.
View | DOI | Download (ext.)
 
[70]
2017 | Conference Paper | IST-REx-ID: 635   OA
Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212. 33–62.
View | DOI | Download (ext.)
 
[69]
2017 | Conference Paper | IST-REx-ID: 697   OA
Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 80.
View | Files available | DOI
 
[68]
2017 | Journal Article | IST-REx-ID: 6196
Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161.
View | Files available | DOI
 
[67]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666. 358–387.
View | DOI | Download (ext.)
 
[66]
2016 | Conference Paper | IST-REx-ID: 1229
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696. 285–303.
View | Files available | DOI
 
[65]
2016 | Conference Paper | IST-REx-ID: 1236
Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610. 413–428.
View | Files available | DOI
 
[64]
2016 | Conference Paper | IST-REx-ID: 1179   OA
Pietrzak KZ, Maciej S. 2016. Pseudoentropy: Lower-bounds for chain rules and transformations. TCC: Theory of Cryptography Conference, LNCS, vol. 9985. 183–203.
View | DOI | Download (ext.)
 
[63]
2016 | Conference Paper | IST-REx-ID: 1233   OA
Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562. 282–305.
View | DOI | Download (ext.)
 
[62]
2016 | Journal Article | IST-REx-ID: 1479
Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
View | Files available | DOI
 
[61]
2016 | Conference Paper | IST-REx-ID: 1653   OA
Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452. 121–145.
View | Files available | DOI
 
[60]
2015 | Conference Paper | IST-REx-ID: 1654   OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.
View | Files available | DOI
 
[59]
2015 | Conference Paper | IST-REx-ID: 1648   OA
Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction for generalized selective decryption on trees. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 601–620.
View | Files available | DOI
 
[58]
2015 | Conference Paper | IST-REx-ID: 1650   OA
Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP: Automata, Languages and Programming, LNCS, vol. 9134. 1046–1057.
View | Files available | DOI
 
[57]
2015 | Conference Paper | IST-REx-ID: 1649   OA
Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325.
View | Files available | DOI
 
[56]
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.
View | Files available | DOI
 
[55]
2015 | Conference Paper | IST-REx-ID: 1669   OA
Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98.
View | Files available | DOI
 
[54]
2015 | Conference Paper | IST-REx-ID: 1671   OA
Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215. 368–387.
View | Files available | DOI
 
[53]
2015 | Conference Paper | IST-REx-ID: 1646   OA
Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic constrained pseudorandom functions. 9015, 31–60.
View | Files available | DOI
 
[52]
2014 | Conference Paper | IST-REx-ID: 2082
Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616. 113–130.
View | Files available | DOI
 
[51]
2014 | Conference Paper | IST-REx-ID: 1927   OA
Fuchsbauer G, Konstantinov M, Pietrzak KZ, Rao V. 2014. Adaptive security of constrained PRFs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 8874. 173–192.
View | DOI | Download (ext.)
 
[50]
2014 | Conference Paper | IST-REx-ID: 2236   OA
Jetchev D, Pietrzak KZ. 2014. How to fake auxiliary input. TCC: Theory of Cryptography Conference, LNCS, vol. 8349. 566–590.
View | Files available | DOI | Download (ext.)
 
[49]
2014 | Conference Paper | IST-REx-ID: 2185   OA
Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441. 93–110.
View | Files available | DOI
 
[48]
2014 | Journal Article | IST-REx-ID: 2852
Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.
View | Files available | DOI
 
[47]
2014 | Conference Paper | IST-REx-ID: 2219   OA
Kiltz E, Masny D, Pietrzak KZ. 2014. Simple chosen-ciphertext security from low noise LPN. IACR: International Conference on Practice and Theory in Public-Key Cryptography, LNCS, vol. 8383. 1–18.
View | DOI | Download (ext.)
 
[46]
2013 | Conference Paper | IST-REx-ID: 2258   OA
Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.
View | Files available | DOI
 
[45]
2013 | Conference Paper | IST-REx-ID: 2259   OA
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
View | Files available | DOI
 
[44]
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.
View | Files available
 
[43]
2013 | Conference Paper | IST-REx-ID: 2940   OA
Krenn S, Pietrzak KZ, Wadia A. 2013. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. TCC: Theory of Cryptography Conference, LNCS, vol. 7785. 23–39.
View | Files available | DOI
 
[42]
2012 | Conference Paper | IST-REx-ID: 2049   OA
Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN. Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549. 346–365.
View | DOI | Download (ext.)
 
[41]
2012 | Conference Paper | IST-REx-ID: 2974   OA
Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658. 663–680.
View | Files available | DOI
 
[40]
2012 | Conference Paper | IST-REx-ID: 3282   OA
Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237. 355–374.
View | Files available | DOI
 
[39]
2012 | Journal Article | IST-REx-ID: 3241
Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135.
View | DOI
 
[38]
2012 | Conference Paper | IST-REx-ID: 3280   OA
Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 548–563.
View | DOI | Download (ext.)
 
[37]
2012 | Conference Paper | IST-REx-ID: 2048   OA
Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography. Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428. 213–232.
View | DOI | Download (ext.)
 
[36]
2012 | Conference Paper | IST-REx-ID: 3250
Pietrzak KZ. 2012. Cryptography from learning parity with noise. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 7147. 99–114.
View | DOI
 
[35]
2012 | Conference Paper | IST-REx-ID: 3279
Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 369–382.
View | DOI | Download (ext.)
 
[34]
2012 | Conference Paper | IST-REx-ID: 3281
Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well. TCC: Theory of Cryptography Conference, LNCS, vol. 7194. 458–475.
View | DOI | Download (ext.)
 
[33]
2011 | Conference Paper | IST-REx-ID: 3240
Barak B, Dodis Y, Krawczyk H, Pereira O, Pietrzak KZ, Standaert F, Yu Y. 2011. Leftover hash lemma revisited. CRYPTO: International Cryptology Conference, LNCS, vol. 6841. 1–20.
View | DOI
 
[32]
2011 | Conference Paper | IST-REx-ID: 3238
Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632. 7–26.
View | Files available | DOI
 
[31]
2011 | Conference Paper | IST-REx-ID: 3239
Faust S, Pietrzak KZ, Venturi D. 2011. Tamper proof circuits How to trade leakage for tamper resilience. ICALP: Automata, Languages and Programming, LNCS, vol. 6755. 391–402.
View | DOI
 
[30]
2011 | Conference Paper | IST-REx-ID: 3236
Jain A, Pietrzak KZ. 2011. Parallel repetition for leakage resilience amplification revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 6597. 58–69.
View | DOI
 
[29]
2010 | Conference Paper | IST-REx-ID: 3237
Kiltz E, Pietrzak KZ. 2010. Leakage resilient ElGamal encryption. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 6477. 595–612.
View | DOI
 
[28]
2010 | Conference Paper | IST-REx-ID: 3233
Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978. 1–18.
View | DOI
 
[27]
2010 | Conference Paper | IST-REx-ID: 3234
Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures. TCC: Theory of Cryptography Conference, LNCS, vol. 5978. 343–360.
View | DOI
 
[26]
2010 | Conference Paper | IST-REx-ID: 3235
Dodis Y, Pietrzak KZ. 2010. Leakage resilient pseudorandom functions and side channel attacks on feistel networks. CRYPTO: International Cryptology Conference, LNCS, vol. 6223. 21–40.
View | DOI
 
[25]
2009 | Conference Paper | IST-REx-ID: 3232
Pietrzak KZ. 2009. A leakage resilient mode of operation. CRYPTO: International Cryptology Conference, LNCS, vol. 5479. 462–482.
View | DOI
 
[24]
2009 | Conference Paper | IST-REx-ID: 3230
Kiltz E, Pietrzak KZ, Stam M, Yung M. 2009. A new randomness extraction paradigm for hybrid encryption. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 5479. 590–609.
View | DOI
 
[23]
2009 | Conference Paper | IST-REx-ID: 3231
Kiltz E, Pietrzak KZ. 2009. On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 5479. 389–406.
View | DOI
 
[22]
2008 | Conference Paper | IST-REx-ID: 3225
Fischlin M, Lehmann A, Pietrzak KZ. 2008. Robust multi property combiners for hash functions revisited. ICALP: Automata, Languages and Programming, LNCS, vol. 5126. 655–666.
View | Files available | DOI
 
[21]
2008 | Conference Paper | IST-REx-ID: 3226
Pietrzak KZ, Sjödin J. 2008. Weak pseudorandom functions in minicrypt. ICALP: Automata, Languages and Programming, LNCS, vol. 5126. 423–436.
View | DOI
 
[20]
2008 | Journal Article | IST-REx-ID: 3227
Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. 2008. Elektrowiz – system of measurement data management. Przeglad Elektrotechniczny. 84(10), 239–242.
View | Download (ext.)
 
[19]
2008 | Conference Paper | IST-REx-ID: 3228
Pietrzak KZ. 2008. Compression from collisions or why CRHF combiners have a long output. CRYPTO: International Cryptology Conference, LNCS, vol. 5157. 413–432.
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 3224
Dodis Y, Pietrzak KZ, Puniya P. 2008. A new mode of operation for block ciphers and length preserving MACs. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4965. 198–219.
View | DOI
 
[17]
2008 | Conference Paper | IST-REx-ID: 3229
Dziembowski S, Pietrzak KZ. 2008. Leakage resilient cryptography. FOCS: Foundations of Computer Science 293–302.
View | DOI
 
[16]
2007 | Conference Paper | IST-REx-ID: 3218
Pietrzak KZ. 2007. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515. 23–33.
View | DOI
 
[15]
2007 | Conference Paper | IST-REx-ID: 3220
Dziembowski S, Pietrzak KZ. 2007. Intrusion resilient secret sharing. FOCS: Foundations of Computer Science 227–237.
View | DOI
 
[14]
2007 | Conference Paper | IST-REx-ID: 3219
Maurer U, Pietrzak KZ, Renner R. 2007. Indistinguishability amplification. CRYPTO: International Cryptology Conference, LNCS, vol. 4622. 130–149.
View | DOI
 
[13]
2007 | Conference Paper | IST-REx-ID: 3221
Pietrzak KZ, Sjödin J. 2007. Range extension for weak PRFs the good the bad and the ugly. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515. 517–533.
View | DOI
 
[12]
2007 | Conference Paper | IST-REx-ID: 3222
Pietrzak KZ, Wikström D. 2007. Parallel repetition of computationally sound protocols revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 4392. 86–102.
View | DOI
 
[11]
2007 | Conference Paper | IST-REx-ID: 3223
Dodis Y, Pietrzak KZ. 2007. Improving the security of MACs via randomized message preprocessing. FSE: Fast Software Encryption, LNCS, vol. 4593. 414–433.
View | DOI
 
[10]
2006 | Conference Paper | IST-REx-ID: 3214
Maurer U, Oswald Y, Pietrzak KZ, Sjödin J. 2006. Luby Rackoff ciphers from weak round functions . EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004. 391–408.
View | DOI
 
[9]
2006 | Conference Paper | IST-REx-ID: 3215
Dodis Y, Pietrzak KZ, Przydatek B. 2006. Separating sources for encryption and secret sharing. TCC: Theory of Cryptography Conference, LNCS, vol. 3876. 601–616.
View | DOI
 
[8]
2006 | Conference Paper | IST-REx-ID: 3216
Pietrzak KZ. 2006. A tight bound for EMAC. ICALP: Automata, Languages and Programming, LNCS, vol. 4052. 168–179.
View | DOI
 
[7]
2006 | Conference Paper | IST-REx-ID: 3217
Pietrzak KZ. 2006. Composition implies adaptive security in minicrypt. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4004. 328–338.
View | DOI
 
[6]
2005 | Conference Paper | IST-REx-ID: 3213
Pietrzak KZ. 2005. Composition does not imply adaptive security. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 55–65.
View | DOI
 
[5]
2005 | Conference Paper | IST-REx-ID: 3211
Bellare M, Pietrzak KZ, Rogaway P. 2005. Improved security analyses for CBC MACs. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 527–545.
View | DOI
 
[4]
2005 | Conference Paper | IST-REx-ID: 3212
Dodis Y, Oliveira R, Pietrzak KZ. 2005. On the generic insecurity of the full domain hash. CRYPTO: International Cryptology Conference, LNCS, vol. 3621. 449–466.
View | DOI
 
[3]
2004 | Conference Paper | IST-REx-ID: 3208
Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951. 410–427.
View | DOI
 
[2]
2003 | Conference Paper | IST-REx-ID: 3210
Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656. 544–561.
View | DOI
 
[1]
2003 | Journal Article | IST-REx-ID: 3209
Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed