Re: presentations about encrypted storage

2008-03-30 Thread Ivan Krstić
On Mar 28, 2008, at 5:48 PM, [EMAIL PROTECTED]  
wrote:
I've got two presentations I've given on encrypted storage  
technologies


On a similar note, list readers might enjoy the detailed writeup of  
Tahoe, the secure distributed erasure-coded filesystem built by Zooko  
and the folks at allmydata.org:


http://allmydata.org/~warner/pycon-tahoe.html

Perry forwarded the Tahoe 0.9 announcement to the list, but it didn't  
include a link to this writeup, which might not have existed at the  
time. As an unrelated bonus and since it doesn't merit a separate  
post, here's a (well-sung!) crypto take on Harry Belafonte's Banana  
Boat Song:


http://www.catonmat.net/blog/musical-geek-friday-crypto/

Cheers,

--
Ivan Krstić [EMAIL PROTECTED] | http://radian.org

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]


Re: [p2p-hackers] convergent encryption reconsidered

2008-03-30 Thread Ivan Krstić

On Mar 20, 2008, at 3:42 PM, zooko wrote:

   They extended the confirmation-of-a-file attack into the
   learn-partial-information attack. In this new attack, the
   attacker learns some information from the file. This is done by
   trying possible values for unknown parts of a file and then
   checking whether the result matches the observed ciphertext.


How is this conceptually different from classic dictionary attacks,  
and why does e.g. running the file through PBKDF2 and using the result  
for convergence not address your concern(s)?


--
Ivan Krstić [EMAIL PROTECTED] | http://radian.org

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]


Re: [p2p-hackers] convergent encryption reconsidered

2008-03-30 Thread Leichter, Jerry
| They extended the confirmation-of-a-file attack into the
| learn-partial-information attack. In this new attack, the
| attacker learns some information from the file. This is done by
| trying possible values for unknown parts of a file and then
| checking whether the result matches the observed ciphertext.
| 
| How is this conceptually different from classic dictionary attacks,
| and why does e.g. running the file through PBKDF2 and using the result
| for convergence not address your concern(s)?
How would that help?

Both the ability of convergent encryption to eliminate duplicates,
and this attack, depend on there being a deterministic algorithm
that computes a key from the file contents.  Sure, if you use a
different salt for each file, the attack goes away - but so does
the de-duplication.  If you don't care about de-duplication, there
are simpler, cheaper ways to choose a key.
-- Jerry

| --
| Ivan Krsti? [EMAIL PROTECTED] | http://radian.org
| 
| -
| The Cryptography Mailing List
| Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]
| 
| 

Hagelin cipher machine for sale on Ebay

2008-03-30 Thread Steven M. Bellovin
http://cgi.ebay.com/ws/eBayISAPI.dll?ViewItemih=005viewitem=item=150231089624rd=1


--Steve Bellovin, http://www.cs.columbia.edu/~smb

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]


Re: [p2p-hackers] convergent encryption reconsidered

2008-03-30 Thread Ivan Krstić

On Mar 30, 2008, at 3:12 PM, Leichter, Jerry wrote:

How would that help?


Unless I'm misunderstanding Zooko's writeup, he's worried about an  
attacker going from a partially-known plaintext (e.g. a form bank  
letter) to a completely-known plaintext by repeating the following  
process:


1. take partially known plaintext
2. make a guess, randomly or more intelligently where possible,
   about the unknown parts
3. take the current integrated partial+guessed plaintext, hash
   to obtain convergence key
4. verify whether that key exists in the storage index
5. if yes, you've found the full plaintext. if not, repeat from '2'.

That's a brute force search. If your convergence key, instead of being  
a simple file hash, is obtained through a deterministic but  
computationally expensive function such as PBKDF2 (or the OpenBSD  
bcrypt, etc), then step 3 makes an exhaustive search prohibitive in  
most cases while not interfering with normal filesystem operation.  
What am I missing?


Cheers,

--
Ivan Krstić [EMAIL PROTECTED] | http://radian.org

-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]