Efficient representation of the attacker's knowledge in cryptographic protocols analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1956588 (Why is no real title available?)
- scientific article; zbMATH DE number 1927581 (Why is no real title available?)
- scientific article; zbMATH DE number 1487854 (Why is no real title available?)
- scientific article; zbMATH DE number 1754628 (Why is no real title available?)
- scientific article; zbMATH DE number 1759624 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- A calculus for cryptographic protocols: The spi calculus
- A calculus of mobile processes. I
- An NP decision procedure for protocol insecurity with XOR
- Automatic recognition of tractability in inference relations
- Introducing commutative and associative operators in cryptographic protocol analysis
- New directions in cryptography
- On the security of public key protocols
- Proof techniques for cryptographic processes
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
Cited in
(2)
This page was built for publication: Efficient representation of the attacker's knowledge in cryptographic protocols analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931442)