_id,doi,title
1479,10.1007/s00037-015-0120-9,A counterexample to the chain rule for conditional HILL entropy
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"
2973,10.1007/978-3-642-36213-2_9,Bringing Zero-Knowledge Proofs of Knowledge to Practice
2259,10.1007/978-3-642-40041-4_4,"Learning with rounding, revisited: New reduction properties and applications"
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
2975,10.1007/978-3-642-25385-0,A Framework for Practical Universally Composable Zero-Knowledge Protocols
2976,10.1109/SP.2011.22,Cache Games - Bringing Access-Based Cache Attacks on AES to Practice
2977,10.1109/ISSA.2011.6027533,cPLC - A Cryptographic Programming Language and Compiler
2978,10.1007/978-3-642-11799-2,Efficiency Limitations for Σ-Protocols for Group Homomorphisms
2979,10.1007/978-3-642-15497-3,A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols
2980,10.1007/978-3-642-16441-5,Automatic Generation of Sigma-Protocols