Oblivious Transfer for Secure Communication
Over 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 runnin...
Main Author: | Parakh, Abhishek |
---|---|
Other Authors: | Hsiao-Chun Wu |
Format: | Others |
Language: | en |
Published: |
LSU
2007
|
Subjects: | |
Online Access: | http://etd.lsu.edu/docs/available/etd-11052007-215229/ |
Similar Items
-
Network oblivious transfer
by: Raghuraman, Srinivasan
Published: (2017) -
Cache-oblivious algorithms
by: Prokop, Harald, 1975-
Published: (2013) -
Bandwidth-sensitive oblivious routing
by: Wen, Tina
Published: (2010) -
Cache-oblivious dynamic search trees
by: Kasheff, Zardosht, 1981-
Published: (2005) -
Software protection and simulation on oblivious RAMs
by: Ostrovsky, Rafail
Published: (2016)