Receiver Anonymity by Incomparable Public Keys: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
There is also a short overview of other methods that have been suggested. |
There is also a short overview of other methods that have been suggested. |
||
== Receiver Anonymity == |
|||
=== Setting for Incomparable Keys === |
|||
=== Previous Research === |
|||
=== Other Methods === |
|||
== Incomparable Public Keys == |
|||
=== Requirements === |
|||
=== Key Generation === |
|||
=== Encryption === |
|||
=== Decryption === |
|||
=== Security === |
|||
=== Performance === |
|||
== Achievements & Shortcomings == |
|||
Revision as of 17:56, 12 June 2007
Abstract
Receiver anonymity means the ability to send one or more messages to a receiver in a way that nobody except the receiver can determine whom the message is intended for, or even if two given messages are intended for the same receiver.
The paper focuses on an approach that achieves this by using a mulitcast network, sending every message to all receivers in the system, and encrypting messages with an asymmetric cryptosystem that is designed in a way to allow the creation of many different public keys (Incomparable Public Keys) corresponding to one single private key.
There is also a short overview of other methods that have been suggested.