{"language":[{"iso":"eng"}],"publication":"Journal of Cryptology","citation":{"chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, 276–306. https://doi.org/10.1007/s00145-017-9257-9.","apa":"Kakvi, S., & Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology, 276–306. https://doi.org/10.1007/s00145-017-9257-9","short":"S. Kakvi, E. Kiltz, Journal of Cryptology (2017) 276–306.","ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology. 2017:276-306. doi:10.1007/s00145-017-9257-9","mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.","bibtex":"@article{Kakvi_Kiltz_2017, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={10.1007/s00145-017-9257-9}, journal={Journal of Cryptology}, author={Kakvi, Saqib and Kiltz, Eike}, year={2017}, pages={276–306} }"},"user_id":"66268","page":"276-306","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2Fs00145-017-9257-9"}],"publication_identifier":{"issn":["0933-2790","1432-1378"]},"status":"public","doi":"10.1007/s00145-017-9257-9","publication_status":"published","title":"Optimal Security Proofs for Full Domain Hash, Revisited","year":"2017","_id":"9607","type":"journal_article","date_updated":"2022-01-06T07:04:16Z","department":[{"_id":"558"}],"date_created":"2019-05-03T12:44:03Z","author":[{"id":"66268","full_name":"Kakvi, Saqib","first_name":"Saqib","last_name":"Kakvi"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"}]}