{"ddc":["000","004"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"title":"Efficient zero-knowledge proofs for commitments from learning with errors over rings","oa":1,"intvolume":"      9326","doi":"10.1007/978-3-319-24174-6_16","ec_funded":1,"alternative_title":["LNCS"],"citation":{"mla":"Benhamouda, Fabrice, et al. <i>Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings</i>. Vol. 9326, Springer, 2015, pp. 305–25, doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">10.1007/978-3-319-24174-6_16</a>.","short":"F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.","ista":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325.","ieee":"F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.","ama":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 2015;9326:305-325. doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">10.1007/978-3-319-24174-6_16</a>","chicago":"Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">https://doi.org/10.1007/978-3-319-24174-6_16</a>.","apa":"Benhamouda, F., Krenn, S., Lyubashevsky, V., &#38; Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">https://doi.org/10.1007/978-3-319-24174-6_16</a>"},"date_published":"2015-01-01T00:00:00Z","quality_controlled":"1","publist_id":"5501","pubrep_id":"678","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge. Our scheme maps elements from the ring (or equivalently, n elements from "}],"file_date_updated":"2020-07-14T12:45:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","publisher":"Springer","day":"01","language":[{"iso":"eng"}],"volume":9326,"year":"2015","date_created":"2018-12-11T11:53:15Z","conference":{"name":"ESORICS: European Symposium on Research in Computer Security","location":"Vienna, Austria","start_date":"2015-09-21","end_date":"2015-09-25"},"date_updated":"2021-01-12T06:52:14Z","file":[{"file_id":"4883","content_type":"application/pdf","checksum":"6eac4a485b2aa644b2d3f753ed0b280b","file_size":494239,"file_name":"IST-2016-678-v1+1_889.pdf","relation":"main_file","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:11:28Z","access_level":"open_access","creator":"system"}],"month":"01","series_title":"Lecture Notes in Computer Science","publication_status":"published","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"oa_version":"Published Version","scopus_import":1,"_id":"1649","status":"public","department":[{"_id":"KrPi"}],"author":[{"first_name":"Fabrice","last_name":"Benhamouda","full_name":"Benhamouda, Fabrice"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Krenn, Stephan"},{"first_name":"Vadim","full_name":"Lyubashevsky, Vadim","last_name":"Lyubashevsky"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"page":"305 - 325"}