Secrecy for bounded security protocols with freshness check is NEXPTIME-complete.
Ferucio Laurentiu TipleaCatalin V. BîrjoveanuConstantin EneaIoana BoureanuPublished in: J. Comput. Secur. (2008)
Keyphrases
- security protocols
- security properties
- key management
- automated design
- key distribution
- pspace complete
- artificial immune algorithm
- security services
- fault tolerance
- cryptographic algorithms
- authentication protocol
- satisfiability problem
- security mechanisms
- cryptographic protocols
- response time
- resource constrained
- np complete
- secure communication
- real time
- wireless sensor networks
- data management
- elliptic curve
- ad hoc networks
- rfid tags