On the security of public key protocols
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Computationally sound implementations of equational theories against passive adversaries
- Analyzing security protocols using time-bounded task-PIOAs
- Reachability is decidable for weakly extended process rewrite systems
- Easy intruder deduction problems with homomorphisms
- On the security of name-stamp protocols
- On the verifiability of two-party algebraic protocols
- On the security of p-party protocols
- Three systems for cryptographic protocol analysis
- A collusion problem and its solution
- A secure address resolution protocol.
- Authentication tests and the structure of bundles.
- Validating firewalls using flow logics
- Finite-state analysis of two contract signing protocols
- Cryptanalysis and design of a three-party authenticated key exchange protocol using smart card
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Authenticated confidential channel establishment and the security of TLS-DHE
- Formally sound implementations of security protocols with JavaSPI
- A Markov adversary model to detect vulnerable iOS devices and vulnerabilities in iOS apps
- Design and analysis of a three party password-based authenticated key exchange protocol using extended chaotic maps
- Secrecy and group creation
- Abstract interpretation of mobile systems
- PRUB: A privacy protection friend recommendation system based on user behavior
- Analysis of security protocols as open systems
- On the symbolic reduction of processes with cryptographic functions.
- A new logic for electronic commerce protocols
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- On the secure implementation of security protocols
- A formal language for cryptographic protocol requirements
- Safe abstractions of data encodings in formal security protocol models
- Abstractions of non-interference security: probabilistic versus possibilistic
- A formal framework for security testing of automotive over-the-air update systems
- Provable security analysis of FIDO2
- A novel ECC-based provably secure and privacy-preserving multi-factor authentication protocol for cloud computing
- Moving the bar on computationally sound exclusive-or
- Attestation waves: platform trust via remote power analysis
- A tutorial-style introduction to \(\mathsf{DY}^{\star}\)
- Security protocols as choreographies
- Secure key management policies in strand spaces
- On the complexity of verification of time-sensitive distributed systems
- Probabilistic annotations for protocol models. Dedicated to Joshua Guttman
- Modular verification of protocol equivalence in the presence of randomness
- Automated identification of desynchronisation attacks on shared secrets
- Timed models of security protocols including delays in the network
- Using probabilistic automata for security protocols verification
- On security in encrypted computing
- A novel quantum dragonfly multi-key exchange protocol beyond conventional attacks
- Cancellation rules and extended word problems
- The RSA group is pseudo-free
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
- Invariant-based reasoning about parameterized security protocols
- Combining proverif and automated theorem provers for security protocol verification
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- Bounded memory protocols
- Models and emerging trends of concurrent constraint programming
- Comment on the ``Quantum public-key cryptosystem
- Formalizing provable anonymity in Isabelle/HOL
- Analysis of security protocols based on challenge-response
- Update semantics of security protocols
- Formal analysis and offline monitoring of electronic exams
- Universally composable symbolic security analysis
- Lattice-based completely non-malleable public-key encryption in the standard model
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
- A formal semantics for protocol narrations
- The reactive simulatability (RSIM) framework for asynchronous systems
- Transducer-based analysis of cryptographic protocols
- Sound and complete computational interpretation of symbolic hashes in the standard model
- On the relationships between models in protocol verification
- Symbolic protocol analysis for monoidal equational theories
- Hierarchical combination of intruder theories
- Breaking and fixing public-key Kerberos
- A framework for compositional verification of security protocols
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Verifying security protocols with PVS: widening the rank function approach
- Logics for reasoning about cryptographic constructions
- Pattern-matching spi-calculus
- Cryptographic protocol security analysis based on bounded constructing algorithm
- A new approach for UC security concurrent deniable authentication
- A symbolic decision procedure for cryptographic protocols with time stamps
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- SoK: lending pools in decentralized finance
- Grafting key trees: efficient key management for overlapping groups
- On the security of a public-key cryptosystem
- DCapBAC: embedding authorization logic into smart things through ECC optimizations
- A sorted semantic framework for applied process calculi (extended abstract)
- Towards an awareness-based semantics for security protocol analysis
- Models for an adversary-centric protocol logic
- Techniques for security checking: non-interference vs control flow analysis
- Modal logics for cryptographic processes
- Deciding the security of protocols with commuting public key encryption
- Rewriting-based verification of authentication protocols
- Protocol composition logic (PCL)
- Computational soundness of symbolic analysis for protocols using hash functions
- Narrowing and rewriting logic: from foundations to applications
- Detection of algebraic manipulation in the presence of leakage
- Secure implementation of asynchronous method calls and futures
- A secure group-based AKA protocol for machine-type communications
- Normalization of linear Horn clauses
- Key Establishment Using Signcryption Techniques
- An introduction to security API analysis
This page was built for publication: On the security of public key protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968876)
