_id,doi,title
605,10.1007/978-3-319-70500-2_3,Position based cryptography and multiparty communication complexity
609,10.1007/978-3-319-70500-2_17,"Moderately hard functions: Definition, instantiations, and applications"
6196,10.13154/TOSC.V2016.I2.145-161,The exact security of PMAC
635,10.1007/978-3-319-56617-7_2,Scrypt is maximally memory hard
637,10.1007/978-3-319-63688-7_5,Be adaptive avoid overcommitting
640,10.1007/978-3-319-56617-7_1,Depth-robust graphs and their cumulative memory complexity
648,10.1007/978-3-319-55911-7_43,On the complexity of breaking pseudoentropy
650,10.1007/978-3-319-55911-7_42,A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
6526,10.1109/isit.2017.8006529,On the complexity of estimating Rènyi divergences
6527,10.1145/3133956.3134031,Practical graphs for optimal side-channel resistant memory-hard functions
1187,10.1007/s00145-016-9247-3,Efficient authentication from hard learning problems
1177,10.1007/s00453-015-9997-6,A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
1179,10.1007/978-3-662-53641-4_8,Pseudoentropy: Lower-bounds for chain rules and transformations
1653,10.1007/978-3-662-48797-6_6,New realizations of somewhere statistically binding hashing and positional accumulators
1479,10.1007/s00037-015-0120-9,A counterexample to the chain rule for conditional HILL entropy
1592,10.1007/s00145-014-9196-7,Structure preserving signatures and commitments to group elements
1365,10.1007/978-3-662-53008-5_9,Efficiently computing data-independent memory-hard functions
1366,10.1007/978-3-662-49890-3_4,Provably robust sponge-based PRNGs and KDFs
1225,10.1007/978-3-319-44618-9_21,Practical round-optimal blind signatures in the standard model from weaker assumptions
1229,10.1007/978-3-319-39555-5_16,Offline witness encryption