Addressing new challenges by building security protocols around graphs

Authors:
Kamil Kulesza;Zbigniew Kotulski
Affiliations:
Computer Science Department, Institute of Fundamental Technological Research, Polish Academy of Sciences, Warsaw, Poland;Computer Science Department, Institute of Fundamental Technological Research, Polish Academy of Sciences, Warsaw, Poland
Venue:
Proceedings of the 11th international conference on Security Protocols
Year:
2003

Citing 7
Cited 1

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Cryptography: Theory and Practice

Cryptography: Theory and Practice
Fundamentals of Computer Security

Fundamentals of Computer Security
Open Questions (Transcript of Discussion)

Revised Papers from the 8th International Workshop on Security Protocols
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Information-theoretically secure secret-key agreement by NOT authenticated public discussion

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

On Mobile Agents Resistance to Traffic Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the use of graphs as basic objects in security protocols. While having all the functionality of their number based counterparts; such protocols can have extended capabilities, especially useful in the field of verification and analysis. The scalability and transitivity for graph related properties allow for addressing protocols of increasing complexity. These features also cater for new challenges in the future, for instance ones resulting from a quantum computing paradigm.