Design and Analysis of a Generalized Canvas Protocol-Reference-Cited by-同舟云学术

Design and Analysis of a Generalized Canvas Protocol

Published:2010 Issue: Volume: Page:106-121
ISSN:0302-9743
Container-title:Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices
language:
Short-container-title:

Author:

Novotný Marián

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12368-9_8

Reference12 articles.

1. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 104–115. ACM, New York (2001)

2. Lecture Notes in Computer Science;A. Armando,2005

3. Blanchet, B.: Automatic Verification of Correspondences for Security Protocols. Journal of Computer Security 17(4), 363–434 (2009)

4. Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: Proceedings of 14th IEEE Computer Security Foundations Workshop, pp. 82–96. IEEE Computer Society, Washington (2001)

5. Lecture Notes in Computer Science;D. Gollmann,2005

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs;Mathematical Structures in Computer Science;2024-01-10

2. Generating Faster Algorithms for d-Path Vertex Cover;Graph-Theoretic Concepts in Computer Science;2023

3. A Survey on the k-Path Vertex Cover Problem;Axioms;2022-04-20

4. 3-path vertex cover and dissociation number of hexagonal graphs;Applicable Analysis and Discrete Mathematics;2022

5. Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs;Lecture Notes in Computer Science;2022