"Provable Unlinkability Against Traffic Analysis with Low Message Overhead."

Ron Berman et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00145-013-9171-8

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/joc/BermanFGKKLT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/joc/BermanFGKKLT15
Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma:
Provable Unlinkability Against Traffic Analysis with Low Message Overhead. J. Cryptol. 28(3): 623-640 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.