Analyzing security protocols using time-bounded task-PIOAs (Q1020557): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10626-007-0032-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098593535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling two views of cryptography (The computational soundness of formal encryption) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing security protocols using time-bounded task-PIOAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of public key protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Q4847023 / rank
 
Normal rank

Latest revision as of 15:19, 1 July 2024

scientific article
Language Label Description Also known as
English
Analyzing security protocols using time-bounded task-PIOAs
scientific article

    Statements

    Analyzing security protocols using time-bounded task-PIOAs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    security protocols
    0 references
    time-bounded task-PIOAs
    0 references
    probabilistic input/output automata
    0 references
    oblivious transfer
    0 references
    0 references