Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




94 Publications

2015 | Conference Paper | IST-REx-ID: 1652 | OA
Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603, doi:10.1145/2746539.2746622.
View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1654 | OA
Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening. Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1668 | OA
Gazi, Peter, et al. Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. Vol. 9054, Springer, 2015, pp. 319–41, doi:10.1007/978-3-662-48116-5_16.
View | DOI | Download Submitted Version (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1669 | OA
Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1671 | OA
Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1672 | OA
Alwen, Joel F., et al. Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting. Vol. 9216, Springer, 2015, pp. 763–80, doi:10.1007/978-3-662-48000-7_37.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, Stefan, et al. Proofs of Space. Vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1474 | OA
Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control. IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2045 | OA
Dachman Soled, Dana, et al. “Enhanced Chosen-Ciphertext Security and Applications.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 329–44, doi:10.1007/978-3-642-54631-0_19.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2046 | OA
Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383, Springer, 2014, pp. 520–37, doi:10.1007/978-3-642-54631-0_30.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2047 | OA
Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:10.1007/978-3-319-11257-2_14.
View | DOI | Download Submitted Version (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2082 | OA
Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:10.1007/978-3-662-44371-2_7.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2185 | OA
Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2219 | OA
Kiltz, Eike, et al. Simple Chosen-Ciphertext Security from Low Noise LPN. Vol. 8383, Springer, 2014, pp. 1–18, doi:10.1007/978-3-642-54631-0_1.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2236 | OA
Jetchev, Dimitar, and Krzysztof Z. Pietrzak. How to Fake Auxiliary Input. Edited by Yehuda Lindell, vol. 8349, Springer, 2014, pp. 566–90, doi:10.1007/978-3-642-54242-8_24.
View | Files available | DOI | Download Submitted Version (ext.)
 
2014 | Journal Article | IST-REx-ID: 2852
Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 1643 | OA
Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” SCN 2014, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:10.1007/978-3-319-10879-7_7.
View | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 1907 | OA
Demay, Grégory, et al. “Optimality of Non-Adaptive Strategies: The Case of Parallel Games.” IEEE International Symposium on Information Theory, 6875125, IEEE, 2014, doi:10.1109/ISIT.2014.6875125.
View | DOI | Download Submitted Version (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2258 | OA
Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2259 | OA
Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2260 | OA
Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.
View | DOI | Download Submitted Version (ext.)
 
2013 | Report | IST-REx-ID: 2274 | OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2291 | OA
Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15.
View | DOI | Download Submitted Version (ext.)
 
2013 | Journal Article | IST-REx-ID: 502
Blazy, Olivier, et al. “Short Blind Signatures.” Journal of Computer Security, vol. 21, no. 5, IOS Press, 2013, pp. 627–61, doi:10.3233/JCS-130477.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2940 | OA
Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2048 | OA
Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” Conference Proceedings CHES 2012, vol. 7428, Springer, 2012, pp. 213–32, doi:10.1007/978-3-642-33027-8_13.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2049 | OA
Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” Conference Proceedings FSE 2012, vol. 7549, Springer, 2012, pp. 346–65, doi:10.1007/978-3-642-34047-5_20.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2937 | OA
Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.
View | DOI | Download Submitted Version (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2974 | OA
Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3250
Pietrzak, Krzysztof Z. Cryptography from Learning Parity with Noise. Vol. 7147, Springer, 2012, pp. 99–114, doi:10.1007/978-3-642-27660-6_9.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3279
Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.
View | DOI | Download None (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3280 | OA
Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp. 548–63, doi:10.1007/978-3-642-28914-9_31.
View | DOI | Download Submitted Version (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3281
Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well. Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.
View | DOI | Download None (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3282 | OA
Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237, Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.
View | Files available | DOI
 

Search

Display / Sort

Citation Style: MLA

Export / Embed