home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.crypt:7123 alt.security.pgp:595
- Newsgroups: sci.crypt,alt.security.pgp
- Path: sparky!uunet!usc!sdd.hp.com!ux1.cso.uiuc.edu!news.cs.indiana.edu!mvanheyn@mango.ucs.indiana.edu
- From: Marc VanHeyningen <mvanheyn@whale.cs.indiana.edu>
- Subject: Re: PGP messages readable by more than one person
- Message-ID: <1993Jan24.213350.17257@news.cs.indiana.edu>
- X-Quoted: 36%
- Organization: Computer Science Dept, Indiana University
- References: <1993Jan23.192239.14870@infodev.cam.ac.uk> <TED.93Jan24183110@pylos.nmsu.edu>
- Date: Sun, 24 Jan 1993 21:33:41 -0500
- Lines: 16
-
- Thus said ted@nmsu.edu (Ted Dunning):
- >perhaps a more interesting (in the sense of puzzle solving) problem is
- >how to extend pgp so that you can send a message that ALL of a group
- >have to agree to read. of course, it isn't that much harder than the
- >previous puzzle, but it is fun.
-
- An interesting generalization of the above is how to cryptographically
- create a situation whereby any m people in a group of n (of course,
- the problem is only hard when n > m > 1) must cooperate to read a
- message. I seem to recall having heard that it's possible, but I
- don't remember the details.
- --
- Marc VanHeyningen mvanheyn@whale.cs.indiana.edu MIME & RIPEM accepted
-
-
- The number of millionares in the U.S. has increased fourteen fold since 1980.
-