Security for wireless internet access
Sarvar Patel, Zulfikar Ramzan, Ganapathy S. Sundaram · Bell Labs Technical Journal · 2002
The rapid growth of the Internet and the explosion of wireless networks have led to new and interesting questions in security. Unlike other fields, security strongly relies on the paradigm “Old is good.” In fact, it takes several years before any security algorithm gains credibility. A relatively new and emerging paradigm, proof-theoretic cryptography, attempts to reduce this “waiting time” for acceptance. In this paper, we survey our research conducted in Lucent Technologies' wireless technology labs on proof-theoretic cryptography. The exposition will be based on some applications to third-generation (3G) wireless systems. Specifically, using the Secure Hash algorithm (SHA) and making various assumptions about its properties, we show how to create a provably secure block cipher, cryptographic pseudorandom generator, and pseudorandom function.3