An application of st-numbering to secret key agreement

DOI10.1142/S0129054111008659MaRDI QIDQ3173946zbMATHOpenAlexFDO

Authors Takaaki Mizuki, Satoru Nakayama, Hideaki Sone

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

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

Recommendations

• Secret key amplification from uniformly leaked key exchange complete graph
• Absolutely secure message transmission using a key sharing graph
• scientific article; zbMATH DE number 970800
• scientific article; zbMATH DE number 1759477
• scientific article; zbMATH DE number 1304085

Cites work

• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• Bounds on secret key exchange using a random deal of cards
• Computing an st-numbering
• Perfectly secure message transmission
• Secure Hypergraphs: Privacy from Partial Broadcast
• Secure communication in minimal connectivity models
• Secure communication in multicast channels: The answer to Franklin and Wright's question
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(1)

• Absolutely secure message transmission using a key sharing graph

This page was built for publication: An application of st-numbering to secret key agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173946)