Movatterモバイル変換

Amos Fiat and Moni Naor

We introduce new theoretical measures for the qualitative and quantitativeassessment of encryption schemes designed for broadcast
transmissions. The goal is to allow a central broadcast site to broadcastsecure transmissions to an arbitrary set of recipients while minimizingkey management related transmissions. We present several schemes that allowa center to broadcast a secret to any subset of privileged users out ofa universe of sizen so that coalitions of k users not inthe privileged set cannot learn the secret.
The most interesting scheme requires every user to store O(k log k log n) keys and the center to broadcast O(k²log²k log n) messages
regardless of the size of the privileged set. This scheme isresilient toany coalition ofkusers. We also present ascheme that is resilient with
probability p against a random subset ofk users. This schemerequires every user to store O(log k log (1/p)) keys and the centerto broadcast O(k log²k log (1/p)) messages.

This is a revised version of the Crypto'93 paper:
Postscript,gzipped Postscript.

Cynthia Dwork, Jeff Lotspiech and Moni Naor,Digital Signets: Self-EnforcingProtection of Digital Information,Abstract,Postscript,gzippedPostscript
Dalit Naor, Moni Naor and Jeff Lotspiech,Revocation and TracingSchemes for Stateless Receivers,Abstract,Postscript,gzippedPostscript
Moni Naor and Benny Pinkas,Threshold Traitor Tracing, Crypto98.Postscript,gzippedPostscript
Moni Naor and Benny Pinkas,Efficient Trace and Revoke Schemes,FC'2000.Postscript,gzippedPostscript

Back to On-Line Publications

Back Home

[8]ページ先頭