_id,doi,title
2852,10.1007/s00145-013-9148-7,Robust multi-property combiners for hash functions
1643,10.1007/978-3-319-10879-7_7,Constrained Verifiable Random Functions 
1907,10.1109/ISIT.2014.6875125,Optimality of non-adaptive strategies: The case of parallel games
2045,10.1007/978-3-642-54631-0_19,Enhanced chosen-ciphertext security and applications
2046,10.1007/978-3-642-54631-0_30,Policy-based signatures
2047,10.1007/978-3-319-11257-2_14,Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases
2082,10.1007/978-3-662-44371-2_7,The exact PRF-security of NMAC and HMAC
2185,10.1007/978-3-642-55220-5_6,Key derivation without entropy waste
2219,10.1007/978-3-642-54631-0_1,Simple chosen-ciphertext security from low noise LPN
2236,10.1007/978-3-642-54242-8_24,How to fake auxiliary input
2940,10.1007/978-3-642-36594-2_2,"A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it"
2258,10.1007/978-3-642-40041-4_31,Digital signatures with minimal overhead from indifferentiable random invertible functions
2259,10.1007/978-3-642-40041-4_4,"Learning with rounding, revisited: New reduction properties and applications"
2260,10.1007/978-3-642-38980-1_33,Efficient signatures of knowledge and DAA in the standard model
2274,,Proofs of Space
2291,10.1109/CSF.2013.15,Cryptographically enforced RBAC
502,10.3233/JCS-130477,Short blind signatures
2937,10.1145/2382196.2382249,Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols
2974,10.1007/978-3-642-34961-4_40,Commitments and efficient zero knowledge proofs from learning parity with noise
3250,10.1007/978-3-642-27660-6_9,Cryptography from learning parity with noise