Formal security proofs with minimal fuss: Implicit computational complexity at work.
David NowakYu ZhangPublished in: Inf. Comput. (2015)
Keyphrases
- computational complexity
- information security
- network security
- security problems
- formal model
- np complete
- intrusion detection
- access control
- special case
- theorem proving
- security issues
- computationally efficient
- rate distortion
- computational efficiency
- high computational complexity
- formal methods
- storage requirements
- security threats
- computer security
- key management
- security mechanisms
- functional requirements
- security requirements
- data mining
- theorem prover
- low complexity
- data security
- security systems
- security level
- decision problems
- computational cost
- security management
- information assurance
- formal proofs