Decidability and combination results for two notions of knowledge in security protocols (Q437043): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-010-9208-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036714652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding knowledge in security protocols under equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile values, new names, and secure communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in commutative theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination problems for commutative/monoidal theories or how algebra can help in equational unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in the union of disjoint equational theories: Combining decision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of constraint solvers for free and quasi-free structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the word problem in the union of equational theories. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP decision procedure for protocol insecurity with XOR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Combination of Intruder Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical combination of intruder theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple presentation of a group with unsolvable word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy intruder deduction problems with homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic protocol analysis for monoidal equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intruder deduction for the equational theory of abelian groups with distributive encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in a combination of arbitrary disjoint equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 12:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Decidability and combination results for two notions of knowledge in security protocols
scientific article

    Statements

    Decidability and combination results for two notions of knowledge in security protocols (English)
    0 references
    0 references
    0 references
    17 July 2012
    0 references
    formal methods
    0 references
    security protocols
    0 references
    equational theories
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references