Provably Secure Cryptography and Its Applications
"Unbreakable cryptography" is crucial in order for secure electronic society. How can we guarantee that a cryptographic scheme is unbreakable? "Does a famous researcher make?" "Is it a standardized protocol by a famous standards body?" However, we know an unfortunate scheme whose vulnerability is found after it became a de-facto standard for e-passports by ISO/IEC. Provable security is a solution against this theme, and guarantees that security of any cryptographic scheme can be proven in a mathematical way. We have studied cryptographic primitives with the provable security. Moreover, we have also studied countermeasures against recent cyber-attacks by utilizing the cryptographic primitives with the provable security.
March 2014 Ph.D. (Engineering), University of Tsukuba
April 2014 Assistant Professor, Graduate School of Information Science and Technology, Osaka University
- E-mail ： yanai@ist.
- Tel ： S4517
The four-digit phone numbers are extensions at Osaka University. To call directly from outside Osaka University, dial a phone number marked S after (area code 06) 6850 or a phone number marked T after (area code 06) 6879. For a phone number marked S (extension), however, first dial the main phone number (06) 6879-5111.
The e-mail addresses are given without the suffix "osaka-u.ac.jp"; add "osaka-u.ac.jp" to each e-mail address.