book chapter published Saqib Kakvi author 66268 Eike Kiltz author 558 department Springer Berlin Heidelberg2012 0302-9743 1611-3349 9783642290107 978364229011410.1007/978-3-642-29011-4_32 537-553 yes S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” in <i>Advances in Cryptology – EUROCRYPT 2012</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 537–553. Kakvi, S., &#38; Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In <i>Advances in Cryptology – EUROCRYPT 2012</i> (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-29011-4_32">https://doi.org/10.1007/978-3-642-29011-4_32</a> Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” In <i>Advances in Cryptology – EUROCRYPT 2012</i>, 537–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-29011-4_32">https://doi.org/10.1007/978-3-642-29011-4_32</a>. S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553. Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Advances in Cryptology – EUROCRYPT 2012</i>, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a>. @inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a>}, booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553} } Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. In: <i>Advances in Cryptology – EUROCRYPT 2012</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:537-553. doi:<a href="https://doi.org/10.1007/978-3-642-29011-4_32">10.1007/978-3-642-29011-4_32</a> 29192018-05-25T12:36:44Z2022-01-06T06:58:47Z