1,956 reputation
515
bio website
location
age
visits member for 3 years
seen 13 hours ago

Dec
3
revised How to prove membership of a list without disclosing the list members?
clarify (I hope)
Dec
2
answered How to prove membership of a list without disclosing the list members?
Dec
1
comment Software implementation of a commutative cipher?
Number of intersections of two sets gives some interesting algorithms that apparently can tell you if you have any SSNs in common, and if so, how many, without leaking any more information.
Nov
22
asked Should we sign-then-encrypt, or encrypt-then-sign?
Nov
13
comment Stretching passwords for encrypting small files
+1 for linking to a complete interoperable best-practice standard for encrypting files -- OpenPGP -- rather than mentioning one particular primitive or another, which all too often are used incorrectly or at least in unnecessarily incompatible ways.
Nov
12
revised protocol-design wiki description
example
Nov
12
suggested suggested edit on protocol-design tag wiki
Nov
2
comment Is there a symmetric-key cryptography based on key establishment techniques?
@D.W. : Yes, Wikipedia's Kerberos protocol article lists a few RFCs that explain the protocol. I wish someone would edit Simple Wikipedia's Kerberos protocol article to explain it in a way that normal humans could understand.
Nov
2
answered Can you use the same key to provide a signature and a MAC?
Nov
2
comment Would this simple encrypted chat program be feasible using One Time Pads?
Yes, the Linux version of /dev/random is the easiest way to do true random number generation. Many hardware random number generators come with a device driver that pulls the random bits from the device, checks every block of samples, and (if it passes the checks) feeds that random data into /dev/random . If your code uses /dev/random , it automatically uses whatever HRNGs are available -- including keyboard events and mouse events.
Nov
2
awarded  Scholar
Nov
2
accepted Has there been any cryptanalysis of RC4-52?
Oct
17
comment Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?
@RickyDemer: I'm no poker expert, but I don't follow. If Alice wants to prove that message A (the ace of hearts with a freshly-generated 256-bit random number) is the same as message B (also the ace of hearts with the same 256-bit random number), can't she simply point out that X and Y are identical, without revealing the 256-bit random number or her private key or the fact that A represents the ace of hearts?
Oct
16
answered Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?
Oct
11
answered One time pad key exchange
Oct
11
revised Avalanche noise RNG for one-time pad use
link to another list of these things
Oct
11
answered Avalanche noise RNG for one-time pad use
Oct
2
comment Tips on conceiving safe software messaging platform
This answer would be more useful if you named specific systems that met those needs. Are you perhaps thinking of Freenet, or what?
Oct
2
revised hash wiki description
rough draft
Oct
2
suggested suggested edit on hash tag wiki