Communicating sequential processes
Communicating sequential processes
IEEE Transactions on Software Engineering
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Proof of separability: A verification technique for a class of a security kernels
Proceedings of the 5th Colloquium on International Symposium on Programming
A Practical Approach to Identifying Storage and Timing Channels: Twenty Years Later
ACSAC '02 Proceedings of the 18th Annual Computer Security Applications Conference
A Model of Cooperative Noninterference for Integrated Modular Avionics
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
A Model of Noninterference for Integrating Mixed Criticality Software Components
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
Design and verification of secure systems
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
The Pump: A Decade of Covert Fun
ACSAC '05 Proceedings of the 21st Annual Computer Security Applications Conference
Proceedings of the 13th ACM conference on Computer and communications security
| Hi-index | 0.00 |
Cryptographic communication protocols frequently employ random numbers to achieve desirable properties. Often, generators for pseudo-random numbers (PRNGs) are employed. A class of PRNGs that currently gains popularity are chaotic PRNGs which are derived ...