On confidentiality and algorithms

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2001, Pages 64-74

  Agat, J ^a   Sands, D ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA PRIVACY; DATABASE SYSTEMS; SORTING;

CONFIDENTIALITY; TIMING CHANNELS;

SECURITY OF DATA;

EID: 0034823291     PISSN: 10637109     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Secrecy by typing in security protocols
2. Transforming out timing leaks
3. Sorting networks and their applications
4. Information transmission in sequential programs
5. Certification of programs for secure information flow
6. Universal hashing and k-wise independent random variables via integer arithmetic without primes
7. Selecting the median
8. Security policies and security models
9. Probabilistic interference
10. The SLam calculus: Programming with secrecy and integrity
11. Compile-time detection of information flow in sequential programs
12. Timing attacks on implementations of diffie-hellman, rsa, dss, and other systems
13. A note on the confinement problem
14. Security models and information flow
15. Probabilistic noninterference for multi-threaded programs
16. Eliminating covert flows with minimum typings
17. A type-based approach to program security
18. Probabilistic noninterference in a concurrent language