ACM Home Page
Please provide us with feedback. Feedback
Some definitions, protocols and proofs about secure authentication
Full text PdfPdf (1.07 MB)
Source IBM Centre for Advanced Studies Conference archive
Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 table of contents
Toronto, Ontario, Canada
SESSION: CORDS table of contents
Pages: 361 - 374  
Year of Publication: 1992
Author
Charles Rackoff  University of Toronto
Sponsor
: IBM Canada Ltd. Laboratory Centre for Advanced Studies
Publisher
IBM Press 
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 11,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

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
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.