|
ABSTRACT
We illustrate the "computational complexity" approach towards defining the goals of security protocols, and proving protocols meet those goals.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
{DH} Diffie, W. and Hellman, M. "New directions in cryptography." IEEE Transactions on Information Theory IT-22 (1976):644--654.
|
 |
3
|
|
| |
4
|
{GKL} Goldreich, O., Krawczyk, H. and Luby, M. "On the existence of pseudorandom generators." 29 IEEE Conference on Foundations of Computer Science(1988):12--24.
|
| |
5
|
{GM} Goldwasser, S. and Micali, S. "Probabilistic encryption." Journal of Computer and Systems Science 28 (1984):270--299.
|
| |
6
|
|
 |
7
|
|
 |
8
|
R. Impagliazzo , L. A. Levin , M. Luby, Pseudo-random generation from one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.12-24, May 14-17, 1989, Seattle, Washington, United States
[doi> 10.1145/73007.73009]
|
 |
9
|
|
| |
10
|
|
| |
11
|
{NBS} National Bureau of Standards, "Data encryption standard", FIPS Pub., 46 (1977).
|
 |
12
|
|
| |
13
|
{Y} Yao, A. "Theory and application of trapdoor functions." 23 IEEE Conference on Foundations of Computer Science (1982):80--91.
|
CITED BY
|
|
Mihir Bellare , Ran Canetti , Hugo Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.419-428, May 24-26, 1998, Dallas, Texas, United States
|
|