Timing-sensitive information flow analysis for synchronous systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4189 LNCS, Issue , 2006, Pages 243-262

  Köpf, Boris ^a   Basin, David ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SYNCHRONOUS MACHINERY; TIMING DEVICES;

CRYPTOGRAPHIC ALGORITHMS; HARDWARE CIRCUITS; INFORMATION LEAKAGE;

DATA FLOW ANALYSIS;

EID: 33750279149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11863908_16     Document Type: Conference Paper

References (29)

1. J. Agat. Transforming out Timing Leaks. In Proc. POPL '00, pages 40-53.
2. G. Barthe, P. D'Argenio, and T. Rezk. Secure Information Flow by Self-Composition. In Proc. CSFW '04, pages 100-114.
3. G. Barthe, T. Rezk, and M. Warnier. Preventing Timing Leaks Through Transactional Branching Instructions. In Proc. QAPL '05.
4. D. Boneh and D. Brumley. Remote Timing Attacks are Practical. In Proc. USENIX Security Symposium '03, 2003.
5. D. Clark, S. Hunt, and P. Malacaria. Quantitative Information Flow, Relations and Polymorphic Types. J. Log. Comput., 18(2):181-199, 2005.
6. M. Davio, J. P. Deschamps, and A. Thayse. Digital Systems with Algorithm Implementation. John Wiley & Sons, Inc., 1983.
7. R. Focardi, R. Gorrieri, and F. Martinelli. Information Flow Analysis in a Discrete-Time Process Algebra. In Proc. CSFW '00, pages 170-184.
8. \8. R. Focardi, S. Rossi, and A. Sabelfeld. Bridging Language-Based and Process Calculi Security, In Proc. FoSSaCS '05, LNCS 3829, pages 299-315.
9. R. Giacobazzi and I. Mastroeni. Abstract non-interference: Parameterizing non-interference by abstract interpretation. In Proc. POPL'04, pages 186-197.
10. R. Giacobazzi and I. Mastroeni. Timed Abstract Non-interference. In Proc. FORMATS'05, LNCS 3829, pages 289-303.
11. P. Kanellakis and S. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, 86:43-68, 1990.
12. P. C. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In Proc. CRYPTO '96, LNCS 1109, pages 104-113.
13. B. Köpf and D. Basin, Timing-Sensitive Information Flow Analysis for Synchronous Systems. Technical Report 526, ETH Zürich, 2006.
14. B. Köpf and H. Mantel. Eliminating implicit information leaks by transformational typing and unification. In In Proc. FAST'05, LNCS 3866, pages 42-62, 2006.
15. G. Lowe. Quantifying Information Flow. In Proc. CSFW '02, pages 18-31.
16. J. D. McLean. A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions. In Proc. IEEE Symp. on Security and Privacy '94, pages 79-93.
17. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
18. D. A. Osvik, A. Shamir, and E. Tromer. Cache Attacks and Countermeasures: the Case of AES. In Proc. CT-RSA '06, LNCS 3860, pages 1-20.
19. R. Paige and R. E. Tarjan. Three Partition Refinement Algorithms. SIAM J. Comput., 6(16):973-989, 1987.
20. P. Puschner and A. Burns. A Review of Worst-Case Execution-Time Analysis. Real-Time Systems, 18(2/3): 115-128, 2000.
21. A. Sabelfeld and A. C. Myers. Language-based Information-Flow Security. J. Selected Areas in Communication, 21(1):5-19, 2003.
22. A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multi-threaded Programs. In Proc. CSFW '00, pages 200-215.
23. A. Sabelfeld and D. Sands. A PER Model of Secure Information Flow in Sequential Programs. Higher-Order and Symbolic Computation, 14(1):59-91, 2001.
24. P. Schaumont and I. Verbauwhede. Domain-Specific Codesign for Embedded Security. IEEE Computer, 36(4):68-74, 2003.
25. P. Schaumont and I. Verbauwhede. The Descriptive Power of GEZEL. Technical report, 2005.
26. G. Smith and D. Volpano. Secure Information Flow in a Multi-Threaded Imperative Language. In Proc. POPL '98, pages 355-364.
27. T. Tolstrup and F. Nielson. Analyzing for Absence of Timing Leaks in VHDL. In Proc. WITS '06 (to appear).
28. T. Tolstrup, F. Nielson, and H. Nielson. Information Flow Analysis for VHDL. In Proc. PaCT '05, LNCS 3606, pages 79-98.
29. D. Volpano and G. Smith. Eliminating Covert Flows with Minimum Typings. In Proc. CSFW '97, pages 156-168.