DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-319-56617-7_2,635,KrPi,Scrypt is maximally memory hard
10.1007/978-3-319-63688-7_5,637,KrPi,Be adaptive avoid overcommitting
10.1007/978-3-319-56617-7_1,640,KrPi,Depth-robust graphs and their cumulative memory complexity
10.1007/978-3-319-55911-7_43,648,KrPi,On the complexity of breaking pseudoentropy
10.1007/978-3-319-55911-7_42,650,KrPi,A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
10.1109/isit.2017.8006529,6526,KrPi,On the complexity of estimating Rènyi divergences
10.1145/3133956.3134031,6527,KrPi,Practical graphs for optimal side-channel resistant memory-hard functions
10.4230/LIPIcs.STACS.2017.57,1174,KrPi,Lower bounds on key derivation for square-friendly applications
10.4230/LIPIcs.ITCS.2017.38,1175,KrPi,Cumulative space in black-white pebbling and resolution
10.1109/EuroSP.2017.47,1176,KrPi,Towards practical attacks on Argon2i and balloon hashing
10.1007/s00145-016-9247-3,1187,KrPi,Efficient authentication from hard learning problems
10.1007/978-3-319-44618-9_21,1225,KrPi,Practical round-optimal blind signatures in the standard model from weaker assumptions
10.1007/978-3-319-39555-5_16,1229,KrPi,Offline witness encryption
10.1007/978-3-662-49896-5_13,1231,"KrPi,VlKo",On the complexity of scrypt and proofs of space in the parallel random oracle model
10.1007/978-3-662-49096-9_12,1233,KrPi,Standard security does imply security against selective opening for markov distributions
10.1007/978-3-319-39555-5_24,1235,KrPi,Constrained PRFs for unbounded inputs with short keys
10.1007/978-3-319-29485-8_24,1236,KrPi,Constrained PRFs for unbounded inputs
10.1007/s00037-015-0120-9,1479,KrPi,A counterexample to the chain rule for conditional HILL entropy
10.1007/s00145-014-9196-7,1592,KrPi,Structure preserving signatures and commitments to group elements
10.1007/978-3-662-48797-6_6,1653,KrPi,New realizations of somewhere statistically binding hashing and positional accumulators