See this document in CiteSeerX!

Verifying Secrets and Relative Secrecy (2000)  (Make Corrections)  (28 citations)
Dennis Volpano, Geoffrey Smith
Symposium on Principles of Programming Languages



  Home/Search   Context   Related

 
View or download:
fiu.edu/~smithg/papers/popl00.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fiu.edu/~smithg/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machine allows one to ask whether a string is the secret PIN of a (lost or stolen) ATM card. Yet such queries are prohibited in any model whose programs satisfy an information-flow property like Noninterference. But there is complexity-based justification for allowing these queries. A type system is given that provides the... (Update)

Cited by:   More
Reconciling Two Views of Cryptography - The Computational Soundness   (Correct)
Unifying Simulatability Definitions in Cryptographic Systems.. - Backes (2003)   (Correct)
Project Description - We Propose To   (Correct)

Similar documents (at the sentence level):
71.1%:   Verifying Secrets and Relative Secrecy - Volpano, Smith (2000)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Language Issues in Mobile Program Security - Volpano, Smith (1998)   (Correct)
0.2:   Noninterference for Concurrent Programs and Thread Systems - Boudol, Castellani (2001)   (Correct)
0.2:   A Sound Polymorphic Type System for a Dialect of C - Smith, Volpano (1998)   (Correct)

Similar documents based on text:   More   All
0.4:   Authentication Method with Impersonal Token Cards - Molva, Tsudik (1993)   (Correct)
0.4:   Guessing Secrets Efficiently via List Decoding - Alon, Guruswami, Kaufman, Sudan   (Correct)
0.3:   All-or Nothing Disclosure of Secrets - Brassard, Crepeau, Robert (1987)   (Correct)

Related documents from co-citation:   More   All
17:   A sound type system for secure flow analysis - Volpano, Smith et al. - 1996
13:   A lattice model of secure information flow (context) - Denning - 1976
13:   Certification of programs for secure information flow (context) - Denning, Denning - 1977

BibTeX entry:   (Update)

Dennis Volpano and Geoffrey Smith. Verifying secrets and relative secrecy. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages, pages 268--276, 2000. http://citeseer.ist.psu.edu/volpano00verifying.html   More

@inproceedings{ volpano00verifying,
    author = "Dennis M. Volpano and Geoffrey Smith",
    title = "Verifying Secrets and Relative Secrecy",
    booktitle = "Symposium on Principles of Programming Languages",
    pages = "268--276",
    year = "2000",
    url = "citeseer.ist.psu.edu/volpano00verifying.html" }
Citations (may not include all citations):
704   Applied Cryptography (context) - Schneier - 1996
246   The exact security of digital signatures|how to sign with RS.. - Bellare, Rogaway - 1996
170   Security policies and security models (context) - Goguen, Meseguer - 1982
161   Timing attacks on implementations of Die-Hellman (context) - Kocher - 1996
114   A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell et al. - 1998
108   Introduction to the Theory of Computation (context) - Sipser - 1997
62   Probabilistic noninterference in a concurrent language - Volpano, Smith - 1999
38   Secure information ow in a multi-threaded imperative languag.. (context) - Smith, Volpano - 1998
35   NP question (context) - Baker, Gill et al. - 1975
31   Practice-oriented provable security - Bellare, Rogaway - 1998
27   A sound type system for secure ow analysis (context) - Volpano, Smith et al. - 1996
6   Provable security for cryptographic protocols|exact analysis.. - Gray, Ip et al. - 1998
5   ow: Practical mostly-static information ow control (context) - Myers - 1999
4   Eliminating covert ows with minimum typings (context) - Volpano, Smith - 1997
2   The generation of random numbers that are provably prime (context) - Beauchemin, Brassard et al. - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.fiu.edu/~smithg/papers/):   More
Language Issues in Mobile Program Security - Volpano, Smith (1998)   (Correct)
Probabilistic Noninterference in a Concurrent Language - Volpano, Smith (1998)   (Correct)
A New Type System for Secure Information Flow - Smith (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC