Optimal Security Proofs for Full Domain Hash, Revisited

S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553.

Download
No fulltext has been uploaded.
Book Chapter | Published
Author
;
Department
Publishing Year
Book Title
Advances in Cryptology – EUROCRYPT 2012
Page
537-553
LibreCat-ID

Cite this

Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. In: Advances in Cryptology – EUROCRYPT 2012. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:537-553. doi:10.1007/978-3-642-29011-4_32
Kakvi, S., & Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In Advances in Cryptology – EUROCRYPT 2012 (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-29011-4_32
@inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={10.1007/978-3-642-29011-4_32}, booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553} }
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” In Advances in Cryptology – EUROCRYPT 2012, 537–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-29011-4_32.
S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” in Advances in Cryptology – EUROCRYPT 2012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 537–553.
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search