Advances in Cryptology – CRYPTO 2004

DOI10.1007/b99099zbMath1104.94052OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311556

C. Pandu Rangan, Arvind Narayanan, Kannan Srinathan

Publication date: 23 August 2005

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

Full work available at URL: https://doi.org/10.1007/b99099

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Oblivious transfer in incomplete networks ⋮ Perfectly Secure Message Transmission in Two Rounds ⋮ Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary ⋮ Secure message transmission in asynchronous networks ⋮ On private computation in incomplete networks ⋮ Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality ⋮ Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary ⋮ Round-efficient perfectly secure message transmission scheme against general adversary ⋮ Secure Message Transmission in Asynchronous Directed Graphs ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary

This page was built for publication: Advances in Cryptology – CRYPTO 2004