Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption

DOI10.1007/978-3-540-85093-9_2MaRDI QIDQ5502787zbMATH OpenOpenAlexFDO

Authors Toshinori Araki

Publication date 9 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85093-9_2

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
• Perfectly Secure Message Transmission in Two Rounds
• Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes

Cited in

(4)

• On one-round reliable message transmission
• Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• A one-round secure message broadcasting protocol through a key sharing tree

This page was built for publication: Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption

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