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