Global ETD Search

1	(M)othering the empire? : a literary study of motherhood in imperial Japan / Kobayashi, Fumiyo. January 2008 (has links) Thesis (Ph. D.)--University of Washington, 2008. / Vita. Includes bibliographical references (leaves 228-245).
2	Moderní metody ověření identity uživatelů / Modern methods for user authentication Sýkora, Daniel January 2009 (has links) The main focus of Master’s thesis is modern methods for user authentication. In the first part are briefly described currently used protocols and pointed out thein advantages and disadvantages. The theoretical introduction analyzes the principles of zero-knowledge authentication, password-based protocols and describes the concept of a new generation hash function. The practical part describes the specific implementation of authentication protocols - Ohta-Okamoto protocol as a representative of the zero knowledge protocols and SRP (Secure Remote Password), which represents password-based protocols. In both cases, the installation procedure is described following the analysis of their implementation (at the source code level) and then compared with the transmitted data captured by Wireshark. The SRP protocol is verified by AVISPA tool. There is summary of both protocols security analysis in the conclusion.
3	Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem Yoshida, Kayo January 2009 (has links) The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model. We present the security proofs for the Boneh-Boyen signature scheme, with the addition of a small improvement in one of the probability bounds. Our main contribution is to give the reduction in the reverse direction; that is, to show that if the SDH problem can be solved then the Boneh-Boyen signature scheme can be forged. This contribution represents the first known proof of equivalence between the SDH problem and Boneh-Boyen signatures. We also discuss the algorithm of Cheon for solving the SDH problem. We analyze the implications of Cheon's algorithm for the security of the Boneh-Boyen signature scheme, accompanied by a brief discussion on how to counter the attack. cryptography digital signatures signature scheme Diffie-Hellman Strong Diffie-Hellman SDH Boneh-Boyen signatures Pollard rho Pollard lambda baby-step giant-step assumptions short signatures random oracle generic group BLS Waters Okamoto identity-based encryption IBE Cheon's algorithm partial fraction security existential forgery Combinatorics and Optimization
4	Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem Yoshida, Kayo January 2009 (has links) The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model. We present the security proofs for the Boneh-Boyen signature scheme, with the addition of a small improvement in one of the probability bounds. Our main contribution is to give the reduction in the reverse direction; that is, to show that if the SDH problem can be solved then the Boneh-Boyen signature scheme can be forged. This contribution represents the first known proof of equivalence between the SDH problem and Boneh-Boyen signatures. We also discuss the algorithm of Cheon for solving the SDH problem. We analyze the implications of Cheon's algorithm for the security of the Boneh-Boyen signature scheme, accompanied by a brief discussion on how to counter the attack. cryptography digital signatures signature scheme Diffie-Hellman Strong Diffie-Hellman SDH Boneh-Boyen signatures Pollard rho Pollard lambda baby-step giant-step assumptions short signatures random oracle generic group BLS Waters Okamoto identity-based encryption IBE Cheon's algorithm partial fraction security existential forgery Combinatorics and Optimization

1

Page generated in 0.028 seconds