Type of Document Master's Thesis Author Parakh, Abhishek URN etd-11052007-215229 Title Oblivious Transfer for Secure Communication Degree Master of Science in Electrical Engineering (M.S.E.E.) Department Electrical & Computer Engineering Advisory Committee
Advisor Name Title Subhash C Kak Committee Chair Hsiao-Chun Wu Committee Member Suresh Rai Committee Member Keywords
- oblivious key exchange
- elliptic curve cryptography
- mutual exchange of secrets
- one-out-of-two oblivious transfer
- oblivious transfer
Date of Defense 2007-09-28 Availability unrestricted AbstractOver the past four decades, computational power and algorithmic strategies have advanced tremendously resulting in an enormous increase in the key sizes required for secure cryptosystems such as RSA. At the same time, the electronic devices have grown smaller and portable requiring algorithms running on them to be optimized in size and efficiency while providing security, at least, equivalent to that provided on a typical desktop computer.
As a result, the industry is moving towards newer cryptosystems such as ECC and NTRU that are well suited for resource constrained environments. While, ECC claims to provide security equivalent to that of RSA for a fraction of key size, NTRU is inherently suited for embedded systems technology.
However, implementation of new cryptosystems requires the development of protocols analogous to those developed using older cryptosystems. In this thesis, we fulfill a part of this requirement by providing protocols for Oblivious Transfer using ECC and NTRU. Oblivious Transfer, in turn, has applications in simultaneous contract signing, digital certified mail, simultaneous exchange of secrets, secure multiparty computations, private information retrieval, etc.
Furthermore, we introduce the idea of basing Oblivious Transfer on public-key exchange protocols. The presentation in the thesis uses Diffie-Hellman Key Exchange, but the scheme is generalizable to any cryptosystem that has a public-key exchange strategy. In fact, our proposal may especially be suited for Quantum Cryptography where the security of key exchange protocols has been proven.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access abhishekparakhthesis.pdf 1.27 Mb 00:05:53 00:03:01 00:02:39 00:01:19 00:00:06
If you have questions or technical problems, please Contact LSU-ETD Support.