AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT

DOI10.1142/S0129054111008659zbMath1222.68037OpenAlexW2140221146MaRDI QIDQ3173946

Hideaki Sone, Satoru Nakayama, Takaaki Mizuki

Publication date: 10 October 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008659

zbMATH Keywords

graph algorithmkey agreement protocolst-numberingkey sharing graphinformation-theoretic secrecy

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH

Cites Work

• Computing an st-numbering
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Bounds on secret key exchange using a random deal of cards
• Secure communication in minimal connectivity models
• Perfectly secure message transmission
• Secure Hypergraphs: Privacy from Partial Broadcast
• Secure communication in multicast channels: The answer to Franklin and Wright's question
• Unnamed Item

This page was built for publication: AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT