An application of st-numbering to secret key agreement

DOI10.1142/S0129054111008659zbMATH Open1222.68037OpenAlexW2140221146MaRDI QIDQ3173946FDOQ3173946

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

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

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)

Cites Work

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

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)