International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Provable Unlinkability Against Traffic Analysis with Low Message Overhead

Authors:
Ron Berman
Amos Fiat
Marcin Gomulkiewicz
Marek Klonowski
Miroslaw Kutylowski
Tomer Levinboim
Amnon Ta-Shma
Download:
DOI: 10.1007/s00145-013-9171-8
Search ePrint
Search Google
BibTeX
@article{jofc-2015-26006,
  title={Provable Unlinkability Against Traffic Analysis with Low Message Overhead},
  journal={J. Cryptology},
  volume={28},
  pages={623-640},
  doi={10.1007/s00145-013-9171-8},
  author={Ron Berman and Amos Fiat and Marcin Gomulkiewicz and Marek Klonowski and Miroslaw Kutylowski and Tomer Levinboim and Amnon Ta-Shma},
  year=2015
}