_id,doi,title
1231,10.1007/978-3-662-49896-5_13,On the complexity of scrypt and proofs of space in the parallel random oracle model
1233,10.1007/978-3-662-49096-9_12,Standard security does imply security against selective opening for markov distributions
1235,10.1007/978-3-319-39555-5_24,Constrained PRFs for unbounded inputs with short keys
1236,10.1007/978-3-319-29485-8_24,Constrained PRFs for unbounded inputs
1644,10.1007/978-3-319-17470-9_10,Query-complexity amplification for random oracles
1645,10.1109/ITW.2015.7133163,Secret-key cryptography from ideal primitives: A systematic verview
1646,10.1007/978-3-662-46497-7_2,Key-homomorphic constrained pseudorandom functions
1647,10.1007/978-3-662-48000-7_12,Practical round-optimal blind signatures in the standard model
1648,10.1007/978-3-662-47989-6_29,A quasipolynomial reduction for generalized selective decryption on trees
1649,10.1007/978-3-319-24174-6_16,Efficient zero-knowledge proofs for commitments from learning with errors over rings
1650,10.1007/978-3-662-47672-7_85,Condensed unpredictability 
1651,10.1007/978-3-662-46447-2_5,Anonymous transferable e-cash
1652,10.1145/2746539.2746622,High parallel complexity graphs and memory-hard functions
1654,10.1007/978-3-662-48800-3_4,Generic security of NMAC and HMAC with input whitening
1668,10.1007/978-3-662-48116-5_16,Relaxing full-codebook security: A refined analysis of key-length extension schemes
1669,10.1007/978-3-319-22174-8_5,"The chain rule for HILL pseudoentropy, revisited"
1671,10.1007/978-3-662-47989-6_18,The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC
1672,10.1007/978-3-662-48000-7_37,Incoercible multi-party computation and universally composable receipt-free voting
1675,10.1007/978-3-662-48000-7_29,Proofs of space
1474,10.1109/CSF.2015.11,Policy privacy in cryptographic access control