- cypherpunks - lists.cpunks.org

[hackerspaces] New effort to fully audit TrueCrypt raises $16, 000+ in a few short weeks
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from ITechGeek <itg(a)itechgeek.com> ----- Date: Thu, 17 Oct 2013 04:43:59 -0400 From: ITechGeek <itg(a)itechgeek.com> To: HacDC <blabber(a)hacdc.org>, HacDC <members(a)hacdc.org>, Hackerspaces General Discussion List <discuss(a)lists.hackerspaces.org>, Chatter <chatter(a)nova-labs.org> Subject: [hackerspaces] New effort to fully audit TrueCrypt raises $16, 000+ in a few short weeks Message-ID: <CAN2EnhCOKEqG+=sA1ZaXcSq=isAEseOHDHaZBYR4UmzeWmd5SQ(a)mail.gmail.com> Reply-To: Hackerspaces General Discussion List <discuss(a)lists.hackerspaces.org> http://arstechnica.com/security/2013/10/new-effort-to-fully-audit-truecrypt… ----------------------------------------------------------------------------------------------- -ITG (ITechGeek) ITG(a)ITechGeek.Com https://itg.nu/ GPG Keys: https://itg.nu/contact/gpg-key Preferred GPG Key: Fingerprint: AB46B7E363DA7E04ABFA57852AA9910A DCB1191A Google Voice: +1-703-493-0128 / Twitter: ITechGeek / Facebook: http://fb.me/Jbwa.Net _______________________________________________ Discuss mailing list Discuss(a)lists.hackerspaces.org http://lists.hackerspaces.org/mailman/listinfo/discuss ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

Re: [p2p-hackers] Distributed identity, chat, publishing, and sharing
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from Sean Lynch <seanl(a)literati.org> ----- Date: Wed, 16 Oct 2013 12:50:55 -0700 From: Sean Lynch <seanl(a)literati.org> To: theory and practice of decentralized computer networks <p2p-hackers(a)lists.zooko.com> Subject: Re: [p2p-hackers] Distributed identity, chat, publishing, and sharing Message-ID: <87a9i9f10g.fsf(a)literati.org> User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux) Reply-To: theory and practice of decentralized computer networks <p2p-hackers(a)lists.zooko.com> ianG <iang(a)iang.org> writes: > BTW, why the keenness on Ed25519? Sorry for the delayed response. I managed to lose track of this message migrating between Gmail and my own server. I like Ed25519 because the public keys are 255 bits long, which makes them potentially usable directly as identifiers. However, more recent events have changed my thinking on this. Schneier speculates that one of the NSA's breakthroughs the Snowden documents talks about may be an advance in the cryptanalysis of ECC systems, and he recommends sticking with better-studied, more conventional systems based on the conventional discrete logarithm problem. On top of that, given the dynamic nature of cryptographic technology, it's probably not a good idea to lock oneself into a particular cryptosystem or hash scheme or even to require that identifiers be keys themselves. An identifier scheme could support Ed25519 as one particularly convenient key type, but eventually we'll want to support fingerprints as identifiers and fetching of public keys from a DHT. -- Sean Lynch <seanl(a)literati.org> _______________________________________________ p2p-hackers mailing list p2p-hackers(a)lists.zooko.com http://lists.zooko.com/mailman/listinfo/p2p-hackers ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

Cryptographer Adi Shamir Prevented from Attending NSA History Conference
by Eugen Leitl 17 Oct '13

17 Oct '13

http://blogs.fas.org/secrecy/2013/10/shamir/ Cryptographer Adi Shamir Prevented from Attending NSA History Conference Categories: Science, Secrecy In this email message to colleagues, Israeli cryptographer Adi Shamir recounts the difficulties he faced in getting a visa to attend the 2013 Cryptologic History Symposium sponsored by the National Security Agency. Adi Shamir is the “S” in the RSA public-key algorithm and is “one of the finest cryptologists in the world today,” according to historian David Kahn. The NSA Symposium begins tomorrow. For the reasons described below, Dr. Shamir will not be there. From: Adi Shamir Date: October 15, 2013 12:16:28 AM EDT To: Subject: A personal apology The purpose of this email is to explain why I will not be able to attend the forthcoming meeting of the History of Cryptology conference, even though I submitted a paper which was formally accepted. As an active participant in the exciting developments in academic cryptography in the last 35 years, I thought that it would be a wonderful opportunity to meet all of you, but unfortunately the US bureaucracy has made this impossible. The story is too long to describe in detail, so I will only provide its main highlights here. I planned to visit the US for several months, in order to attend the Crypto 2013 conference, the History of Cryptology conference, and to visit several universities and research institutes in between in order to meet colleagues and give scientific lectures. To do all of these, I needed a new J1 visa, and I filed the visa application at the beginning of June, two and a half months before my planned departure to the Crypto conference in mid August. I applied so early since it was really important for me to attend the Crypto conference – I was one of the founders of this flagship annual academic event (I actually gave the opening talk in the first session of the first meeting of this conference in 1981) and I did my best to attend all its meetings in the last 32 years. To make a long story short, after applying some pressure and pulling a lot of strings, I finally got the visa stamped in my passport on September 30-th, exactly four months after filing my application, and way beyond the requested start date of my visit. I was lucky in some sense, since on the next day the US government went into shutdown, and I have no idea how this could have affected my case. Needless to say, the long uncertainty had put all my travel plans (flights, accomodations, lecture commitments, etc) into total disarray. It turns out that I am not alone, and many foreign scientists are now facing the same situation. Here is what the president of the Weizmann Institute of Science (where I work in Israel) wrote in July 2013 to the US Ambassador in Israel: “I’m allowing myself to write you again, on the same topic, and related to the major difficulties the scientists of the Weizmann Institute of Science are experiencing in order to get Visa to the US. In my humble opinion, we are heading toward a disaster, and I have heard many people, among them our top scientists, saying that they are not willing anymore to visit the US, and collaborate with American scientists, because of the difficulties. It is clear that scientists have been singled out, since I hear that other ‘simple citizen’, do get their visa in a short time.” Even the president of the US National Academy of Science (of which I am a member) tried to intervene, without results. He was very sympathetic, writing to me at some stage: “Dear Professor Shamir I have been hoping, day by day, that your visa had come through. It is very disappointing to receive your latest report. We continue to try by seeking extra attention from the U. S. Department of State, which has the sole authority in these matters. As you know, the officers of the Department of State in embassies around the world also have much authority. I am personally very sympathetic and hopeful that your efforts and patience will still yield results but also realize that this episode has been very trying. We hope to hear of a last-minute success. Yours sincerely, Ralph J. Cicerone” What does all of this have to do with the History of Cryptology conference? In January 2013 I submitted a paper titled “The Cryptology of John Nash From a Modern Perspective” to the conference, and a short time afterwards I was told by the organizers that it was accepted. In July 2013 I told the NSA-affiliated conference organizers that I was having some problems in getting my visa, and gently asked whether they could do something about it. Always eager to help, the NSA people leaped into action, and immediately sent me a short email written with a lot of tact: “The trouble you are having is regrettable…Sorry you won’t be able to come to our conference. We have submitted our program and did not include you on it.” I must admit that in my 35 years of attending many conferences, it had never happened to me that an accepted paper of mine was yanked out from the official program in such a unilateral way. However, since I never try to go to places where I do not feel wanted, I decided to inform MIT that a window had become available in my busy schedule. They immediately invited me to visit them on October 17 and 18, and to give a major lecture during my visit. Naturally, I accepted their gracious invitation. The final twist in this saga happened a few days ago, when out of the blue I was suddenly reinvited by the conference organizers to attend the event and to present my paper. However, this is too late now, since I am already fully committed to my visit to MIT. So what is the bottom line of this whole unhappy episode? Clearly, no one in the US is trying to see the big picture, and the heavy handed visa bureaucracy you have created seems to be collapsing under its own weight. This is not a security issue – I have been to the US close to a hundred times so far (including some multi-year visits), and had never overstayed my visas. In addition, the number of terrorists among the members of the US National Academy of Science is rather small. As a friend of the US I am deeply worried that if you continue to delay visas in such a way, the only thing you will achieve is to alienate many world-famous foreign scientists, forcing them to increase their cooperation with European or Chinese scientists whose countries roll the red carpet for such visits. Is this really in the US best interest? Best personal wishes, and apologies for not being able to meet you in person, Adi Shamir

1 0

Re: [Cryptography] /dev/random is not robust
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from Theodore Ts'o <tytso(a)mit.edu> ----- Date: Wed, 16 Oct 2013 15:11:12 -0400 From: Theodore Ts'o <tytso(a)mit.edu> To: Jerry Leichter <leichter(a)lrw.com> Cc: Sandy Harris <sandyinchina(a)gmail.com>, Cryptography <cryptography(a)metzdowd.com> Subject: Re: [Cryptography] /dev/random is not robust Message-ID: <20131016191112.GD11604(a)thunk.org> User-Agent: Mutt/1.5.21 (2010-09-15) On Wed, Oct 16, 2013 at 01:58:31PM -0400, Jerry Leichter wrote: > > None of this matters much if the enemy does not already have root on > > your system. > Backwards security is a prerequisite for building PFS, among other > things. Without it, if an attacker seizes your system, he can (in > principle, but we're considering *potential capabilities*, not what > we know how to do in detail today) "run the random number generator > backwards".... Actually, the scenario you describe above is called "forward security" in the referenced paper. That's granted. It's also not a problem with Linux's /dev/random, so what you are complaining about is a straw man argument. What I think folks (including myself) are much convinced by is the importance of worrying about the other attacks detailed in the paper, where the attacker is presumed to be able to control the entropy sources to some arbitrary extent. In the case of Linux's /dev/random, that means the the adversary would be able to control the exact timing of interrupts in the system in such a way that the entropy estimators would be fooled. > I'm amazed and disturbed by the nature of the responses to this > paper. They are *indistinguishable* from the typical PR blather we > get from every commercial operation out there when someone reports a > potential attack: It's just theory, it can't be translated into > practice, we have multiple layers of security so even if one of them > can be attacked the others still protect you, yadda yadda yadda. So if someone would like to make a concrete suggestion, I'm certainly willing to entertain a specific proposal. I'll note first of all that FreeBSD's use of Yarrow still uses an entropy estimator, and so it doesn't answer the paper's complaint that "all entropy estimators are crap, and we shouldn't trust any RNG that uses an entropy estimator". I've also said that I might be willing to add some arbitrary threshold were reads to /dev/urandom will block until we estimate that we've received a certain amount of entropy --- although I'd first like to make sure we get as much entropy as possible, so we don't block for too long first. There are some real practical problems on certain embedded platforms where we don't have access to high resolution CPU counters which as far as I'm concerned is a highr priority. This however, is still going to cause academics to kvetch about how we are hopeless, since they disbelieve in entropy estimators and insist on an attack model where the attacker can arbitrarily influence interrupt timing. Furthermore, in the area of the cold start problem, which is the much more real and more practical problem, Fortuna doesn't help, since it in a cold start scenario, it has no idea when it's safe to allow someone to draw from Fortuna --- since in order to do that would rely on an entropy estimator which the academics disbelieve in! > There's always been a strain of anti-academy bias - even > anti-intellectualism - in the OSS community. It's highly > undesirable. There's good academic academic work, and there's bad > academic work. Even with the domain of good academic work, some is > of practical interest today, and some isn't. (And some that isn't > of interest today may be tomorrow.) I prefer to call it "healthy skepticism". As I've said elsewhere, I recall the huge focus on formal verification of computer programs, and the very large number of trees that were killed over that particular academic fad. If we consider the use of techniques that have _actually_ improved security: valgrind, ASLR, static code analysis, how many of them have actually come from academics? The only one I can think of is Coverity, and even there, most of the work was done in a commercial setting, *not* an academic one. (In another area, the academic focus on real-time scheduling (at least five years ago, when I was focusing on that as the technical lead of a Real-Time Linux effort at IBM in support of the US Navy's DDX-1000 next generation destroyer), was completely divergent from what we were actually using in industry. Why? Because by the time the perfect real-time scheduling algorithms were finished running, especially in a dynamic environment, you were pretty much guaranteed to miss *all* of your deadlines and the missle which had popped above the radar horizen unexpectedly would have long ago exploded amidships!) Going back to the random number generators, there are a lot of practical issues, such as making sure the entropy collection is fast enough that downstream kernel engineers and device driver maintainers don't just turn off the entropy collection. This can sometimes happen in embedded kernels, and you might not ever know that this has happened. This is not an academic concern, but it's a real one. On another front, I recently noticed that on my Debian Testing box, the openssl librcrypto library is apparently not using /dev/urandom or /dev/random by default. Hence, if you don't have a ~/.rnd file, any public/private key pairs that you might generate would have no entropy at all! How did I notice this? Because I added a kernel trace point so I could monitor how much use of /dev/random was being used by various userspace progam. I was originally concerned by overuse of /dev/urandom where it wasn't needed, but then I discovered than "openssl genrsa" and "ssh-keygen" is apparently not using /dev/urandom or /dev/random at all(!!!). (Fortunatly this does not appear to be the case on Debian Stable, so it looks like a recent regression. Or maybe it's a misconfiguration on my end, but (a) I'm getting lost trying to figure out the mazy of twisty compile-time and run-time configuration options of OpenSSL, complicated by the Debian packaging system, and (b) even if it is somehow "my fault", it shouldn't be that easy to have things silently fail to have no entropy at all.) So quite frankly, I have much bigger fish to fry, and I have to prioritize my time, since I don't get paid to maintain the Linux random number generator and so my time is not unlimited. > This kind of "shoot the messenger" approach is just plain wrong. > Look at the definition of robustness they come up with and tell me > what parts of it aren't things you'd *like* to get in your RNG, if > you could. Can you come up with anything beyond hand-waving to show > that the Linux RNG actually provides you with those properties? #1. I've read through the paper, and the there is nothing new in the paper that I consider as something I'd like in the RNG. I do care about what they call "forwards security", where compromise of the random state pool does not compromise past results. That's not a new requirement, and it's one which I'm satisfied that we meet. #2. I'm not obligated to prove to *you* anything. I don't get paid or my prospects for promotion do not go up by spending hours writing an peer-reviewed paper. So if you are demanding a formal proof, in the form of an academic paper, instead of "mere handwaving", you can demand anything you want. I get demands for free programming efforts for pet features to my OSS code all the time, and I know how to handle such requests/demands. #3. Let me turn this around, and ask *you* to give me concrete suggestions about changes you'd like to make, preferably in the form of a patch. I'll tell you right away that both Fortuna and Yarrow, which use crypto hashing in the entropy mixing step, is going to be a non-starter from a performance point of view. It's not hypothetical when I talk about embedded shops demanding of their Linux kernel developers That they disable entropy collection. That has actually happened, and I've engaged said embedded kernel developer who got pressure from his management to do this on LKML to try to address that particular concern. To that end, I've made the entropy collection even lighter-weight that will be merged into the next kernel merge window, and I believe I've done it in a way that preserves our security properties. So when you ask me to worry about a hypothetical attack where an adversary might be able to control all interrupt timing, and I'm dealing with an actual attack where the adversary (also known as the product manager :-) demanding that entropy collection be disabled, please don't be offended when I don't take you all that seriously. Especially when the "academically approved" RNG's don't fare all that well in a world where all entropy estimators are f*cked and interrupt timing and other entropy sources are subject to fine-grained control by the remote attacker. (Even Fortuna, if you are worried about the cold start problem.) Regards, - Ted P.S. If you actually read the /dev/random source code, and take a look at the git commit logs, you'll see that I have made changes in response to academic papers, and I make sure to give them full credit in the comments. My bias only comes because I've seen so much academic work which has very little relationship to the problems that I need to worry about as a practicing engineer. _______________________________________________ The cryptography mailing list cryptography(a)metzdowd.com http://www.metzdowd.com/mailman/listinfo/cryptography ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

Re: [p2p-hackers] Distributed identity, chat, publishing, and sharing
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from ianG <iang(a)iang.org> ----- Date: Thu, 17 Oct 2013 11:01:15 +0300 From: ianG <iang(a)iang.org> To: p2p-hackers(a)lists.zooko.com Subject: Re: [p2p-hackers] Distributed identity, chat, publishing, and sharing Message-ID: <525F994B.1070906(a)iang.org> User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:24.0) Gecko/20100101 Thunderbird/24.0.1 Reply-To: theory and practice of decentralized computer networks <p2p-hackers(a)lists.zooko.com> Just some thoughts. I wasn't able to find my original post asking that question... On 16/10/13 22:50 PM, Sean Lynch wrote: > ianG <iang(a)iang.org> writes: > >> BTW, why the keenness on Ed25519? > > Sorry for the delayed response. I managed to lose track of this message > migrating between Gmail and my own server. > > I like Ed25519 because the public keys are 255 bits long, which makes > them potentially usable directly as identifiers. However, more recent > events have changed my thinking on this. Schneier speculates that one of > the NSA's breakthroughs the Snowden documents talks about may be an > advance in the cryptanalysis of ECC systems, and he recommends sticking > with better-studied, more conventional systems based on the conventional > discrete logarithm problem. The NSA/Snowden disclosures is a very dynamic area and our understanding is changing as new info comes in. FWIW, I think this is more likely the case: NSA successfully moved the world across to *standards based* ECC. This concentrates the target, and gave them a chance to influence the nature and direction of the production of constants, sizes and so forth. Back in the early 2000s, ECC was hot, as the CEO of RSA has infamously said, and everyone just took the wisdom of NSA without question. But now there has been a lot of work done by a lot of open mathematicians. What they are discovering is that ECC is quite finicky, and the standards-based curves are rapidly starting to look less shiny. Hence, picking an independent effort that utilises all this last-decade work, and generates independent curves, is possibly a better way to go. http://safecurves.cr.yp.to/ (Remember, however, you have to decide how much you care about the NSA as being your threat model. 1. Is it a sole, life threatening threat? 2. Or is it just a great target? 3. Or is it meaningless? They have the data anyway? There are very few systems that are building for the first case. Most of us would be happy with choosing the type 2 threat model, in which case we can just pick the state of the art (curves) implement and move on.) > On top of that, given the dynamic nature of cryptographic technology, > it's probably not a good idea to lock oneself into a particular > cryptosystem or hash scheme or even to require that identifiers be keys > themselves. I disagree. The history of agility has been poor, IMHO. Instead, I suggest that you lock yourself into the best possible system on today's knowledge -- it's your job, do it! -- and then plan on a complete refit in say 7 years time. Any problems that come up won't be predictable, and you'll not be able to do more than complicate everything anyway. http://iang.org/ssl/h1_the_one_true_cipher_suite.html Good work has sustained far better than we typically give credit for, and bad work has been maintained into a dog's breakfast, without giving damnation due to it. > An identifier scheme could support Ed25519 as one > particularly convenient key type, but eventually we'll want to support > fingerprints as identifiers and fetching of public keys from a DHT. That's a separate question -- where the authentication resides. As a thought experiment, I really like the conceptual approach taken by tcpcrypt which (in short) does an ephemeral lower layer, and provides the params up to a higher layer (application) at which the auth questions can be handled. As it states, authentication is an application level concept, not a lower layer concept. iang _______________________________________________ p2p-hackers mailing list p2p-hackers(a)lists.zooko.com http://lists.zooko.com/mailman/listinfo/p2p-hackers ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

[tor-talk] Roger's status report, September/October 2013
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from Roger Dingledine <arma(a)mit.edu> ----- Date: Thu, 17 Oct 2013 02:47:15 -0400 From: Roger Dingledine <arma(a)mit.edu> To: tor-talk(a)lists.torproject.org Cc: tor-reports(a)lists.torproject.org Subject: [tor-talk] Roger's status report, September/October 2013 Message-ID: <20131017064715.GD31806(a)moria.seul.org> User-Agent: Mutt/1.5.20 (2009-06-14) Reply-To: tor-talk(a)lists.torproject.org Six things I did in September/October 2013: 1) Released Tor 0.2.4.17-rc: https://lists.torproject.org/pipermail/tor-talk/2013-September/029857.html including writing the fix to prioritize NTor handshakes so Tor 0.2.4.x remains usable despite the five million new bot users: https://trac.torproject.org/projects/tor/ticket/9574 Released Tor 0.2.5.1-alpha: https://lists.torproject.org/pipermail/tor-talk/2013-October/030269.html 2) Wrote many blog posts: https://blog.torproject.org/blog/how-to-handle-millions-new-tor-clients with a follow-up summary at http://tor.stackexchange.com/questions/115/how-to-prevent-the-mevade-botnet… https://blog.torproject.org/blog/tor-nsa-gchq-and-quick-ant-speculation https://blog.torproject.org/blog/tor-and-silk-road-takedown https://blog.torproject.org/blog/yes-we-know-about-guardian-article https://blog.torproject.org/blog/lifecycle-of-a-new-relay https://blog.torproject.org/blog/improving-tors-anonymity-changing-guard-pa… and also answered hundreds of blog comments / questions. 3) Talked to many many journalists to explain Tor and the Internet. My most useful quotes went to Bruce Schneier: http://www.theguardian.com/world/2013/oct/04/nsa-gchq-attack-tor-network-en… and Brian Fung: http://www.washingtonpost.com/blogs/the-switch/wp/2013/09/06/the-feds-pays-… and Dan Goodin: http://arstechnica.com/security/2013/10/how-the-nsa-might-use-hotmail-or-ya… 4) Helped the Tor Stack Exchange beta get off the ground: http://tor.stackexchange.com/ I zipped up to 1000+ reputation from answering questions in the first few days, but then I disappeared because I was distracted by other work. Hopefully other people have filled in the gap. 5) Helped sort out the 2013 Q4 budget, and also get the new SponsorO projects off the ground: https://trac.torproject.org/projects/tor/wiki/org/sponsors/Otter 6) Attended the SponsorF "red team assessment" where they funded some smart DPI developers to evaluate and try to break Obfsproxy and Flash Proxy. So far so good -- one of the outcomes is that we should set up a performance testbed for Flash Proxy to see if we can replicate their "sometimes when I upload a bunch of stuff it takes a long time" behavior. I plan to talk to Arlo, once I'm back online, about doing that. ------------------------------------------------------------------------- Seven smaller things I did in September/October 2013: 7) Did a talk at PLUG: http://www.phillylinux.org/meetings.html 8) Sorted out a potential anonymity issue that is a great use case for the TorPS path calculator: https://lists.torproject.org/pipermail/tor-dev/2013-September/005475.html https://trac.torproject.org/projects/tor/ticket/9777 but then haven't followed up yet. 9) Helped a bit with the EPIC BBG FOIA press fuss, which ended with: http://epic.org/2013/09/epic-foia-request-reveals-no-e.html Now ya'll can read the analysis I wrote for BBG of why no single organization should run too many Tor relays: http://epic.org/foia/Tor_Docs.pdf 10) Submitted a 30c3 talk with Jake. Hopefully we'll do a big-room talk where we can lay out all the Tor myths and confusions of 2013. 11) Refused my invite to the IEEE Security & Privacy (Oakland) 2004 Program Committee because of IEEE's anti-science publishing policy: http://www.researchwithoutwalls.org/ 12) Posted a list of "Criteria for prioritizing pluggable transport work": https://lists.torproject.org/pipermail/tor-dev/2013-September/005528.html 13) Helped Arlo move forward with his https://check2.torproject.org/ alternative Tor Check implementation. I sure am looking forward to the time when he thinks it's ready to go live. ------------------------------------------------------------------------- I am going offline now for roughly the rest of October. --Roger -- tor-talk mailing list - tor-talk(a)lists.torproject.org To unsubscribe or change other settings go to https://lists.torproject.org/cgi-bin/mailman/listinfo/tor-talk ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

Re: Curious use of cpunks list [Brian Carroll]
by John Young 17 Oct '13

17 Oct '13

By far all reputable and objective polls, affirmed by Rushmore big heads Bruce Schneier and Glenn Greenwald, confirm online usage is totally schizophrenic, escapist, indolent, idle, pointless, still it far outdistances all alternatives in the race to maximize and deny blood doping, elbowing competitors, hiring fans to run naked on TV, lying recantations about never using self-loathing enhancers. Diagnosis: crypto dependency, cold dead hands, N =/ P, PK idolatry, carpal tunnel mentality, ego aerostated by panoptic auto-sphrincterism. Brian Carroll, occasionally self-titled Brain Carroll, is a very smart and polite gentleman who does not mind fools fooling themselves psychobabbling like paranormal tricyclists monomaniacal about can there ever be reliable RNGs.

4 3

Re: [Cryptography] /dev/random is not robust
by Eugen Leitl 17 Oct '13

17 Oct '13

----- Forwarded message from Jerry Leichter <leichter(a)lrw.com> ----- Date: Wed, 16 Oct 2013 13:58:31 -0400 From: Jerry Leichter <leichter(a)lrw.com> To: Sandy Harris <sandyinchina(a)gmail.com> Cc: Cryptography <cryptography(a)metzdowd.com> Subject: Re: [Cryptography] /dev/random is not robust Message-Id: <D3EECDC9-C637-48F5-B3E6-458F93E1C0A4(a)lrw.com> X-Mailer: Apple Mail (2.1510) On Oct 16, 2013, at 8:49 AM, Sandy Harris <sandyinchina(a)gmail.com> wrote: > From the paper: > > " Several security notions have been defined: > " – Resilience: an adversary must not be able to predict future PRNG > outputs even if he can influence the entropy source used to initialize > or refresh the internal state of the PRNG; > " – Forward security ( resp. backward security): an adversary must not > be able to predict past (resp. future) outputs even if he can > compromise the internal state of the PRNG. > " ... Barak and Halevi [BH05] model a PRNG with input ... and define a > new security property called robustness that implies resilience, > forward and backward security. This property actually assesses the > behavior of a PRNG after compromise of its internal state ... > > None of this matters much if the enemy does not already have root on > your system. Backwards security is a prerequisite for building PFS, among other things. Without it, if an attacker seizes your system, he can (in principle, but we're considering *potential capabilities*, not what we know how to do in detail today) "run the random number generator backwards", which would allow any keys that were created using the RNG - like those created in "secure" DH negotiations, for example - to be generated. (But keep in mind the adage: Attacks only get better.) > If an enemy does have root, he has far better targets > than the RNG available and the defenders have bigger worries. Without > root, he cannot see the internal state and, if you use the typical > setup where some saved entropy from last time is pumped in by the boot > scripts, he cannot read that file and using it seems to complicate the > state enough for security.... Also, the definition of resilience mentions an adversary who "can influence the entropy source" but the random(4) driver uses multiple sources so the degree of influence is generally limited.... I'm amazed and disturbed by the nature of the responses to this paper. They are *indistinguishable* from the typical PR blather we get from every commercial operation out there when someone reports a potential attack: It's just theory, it can't be translated into practice, we have multiple layers of security so even if one of them can be attacked the others still protect you, yadda yadda yadda. Yes, this is a theoretical attack. Yes, the Linux RNG is much more complex than the attackers assume in their model. (Complexity is a good thing?) No, no one is likely to be able to be able to use the attack actually get much out of the Linux RNG. But attacks only get better. The fact is, the Linux RNG, like all the "stir entropy into the pool" RNG's out there, were developed in an essentially ad hoc fashion, without even a solid idea of what the desired properties of such a primitive are supposed to be. This paper is a step along a path begun in 2005 by Barak and Halevi (the instant paper has extensive references), and, frankly, it's about time. For such RNG's we've been in about the same position we were in for ciphers in the 1980's and even beyond, before a great deal of theoretical effort got us to characterizations like IND-CPA and all sorts of excellent work on tight reductions and concrete security. There's always been a strain of anti-academy bias - even anti-intellectualism - in the OSS community. It's highly undesirable. There's good academic academic work, and there's bad academic work. Even with the domain of good academic work, some is of practical interest today, and some isn't. (And some that isn't of interest today may be tomorrow.) This kind of "shoot the messenger" approach is just plain wrong. Look at the definition of robustness they come up with and tell me what parts of it aren't things you'd *like* to get in your RNG, if you could. Can you come up with anything beyond hand-waving to show that the Linux RNG actually provides you with those properties? Suppose someone was able to build on the current paper's work and design a Linux RNG that actually *did* provide those properties, with performance comparable to what we have today? That's how, for example, we've gotten beyond the old, ineffective Modes of Operation to modern ones that have actual security techniques. Wouldn't it be nice to be able to make the same transition for RNG's? How will we ever do so without the initial work of the theoreticians to provide a target to aim for? -- Jerry _______________________________________________ The cryptography mailing list cryptography(a)metzdowd.com http://www.metzdowd.com/mailman/listinfo/cryptography ----- End forwarded message ----- -- Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org ______________________________________________________________ ICBM: 48.07100, 11.36820 http://ativel.com http://postbiota.org AC894EC5: 38A5 5F46 A4FF 59B8 336B 47EE F46E 3489 AC89 4EC5

1 0

[RISKS] Risks Digest 27.54
by RISKS List Owner 17 Oct '13

17 Oct '13

RISKS-LIST: Risks-Forum Digest Wednesday 16 October 2013 Volume 27 : Issue 54 ACM FORUM ON RISKS TO THE PUBLIC IN COMPUTERS AND RELATED SYSTEMS (comp.risks) Peter G. Neumann, moderator, chmn ACM Committee on Computers and Public Policy ***** See last item for further information, disclaimers, caveats, etc. ***** This issue is archived at <http://www.risks.org> as <http://catless.ncl.ac.uk/Risks/27.54.html> The current issue can be found at <http://www.csl.sri.com/users/risko/risks.txt> Contents: Adi Shamir Prevented from Attending Crypto and Cryptology Conferences (PGN) An App That Saved 10,000 Lives (Amy O'Leary via Monty Solomon) >From the Start, Signs of Trouble at Health Portal (Pear et al. via Monty Solomon) Deloitte IT projects plagued with troubles around the country (Woolhouse and Healy via Monty Solomon) Online Application Woes Make Students Anxious and Put Colleges Behind Schedule (Lauren Weinstein) Deutsche Telekom hopes to hide German Internet traffic from spies (Lauren Weinstein) "We can't let the Internet become Balkanized" (Sascha Meinrath via NNSquad) "Risk considerations: Tracking services monitor your every move" (Steve Ragan via Gene Wirchenko) Abridged info on RISKS (comp.risks) ---------------------------------------------------------------------- Date: Wed, 16 Oct 2013 9:43:36 PDT From: "Peter G. Neumann" <neumann(a)csl.sri.com> Subject: Adi Shamir Prevented from Attending Crypto and Cryptology Conferences Adi Shamir applied for a J1 visa at the beginning of June 2013, two and one-half months early, so that he could attend the annual Crypto Conference in Santa Barbara in mid-August (which he has almost always attend for the past 32 years) and a subsequent NSA-affiliated History of Cryptography Conference -- at which he was to present his paper, The Cryptology of John Nash from a Modern Perspective. As the S in RSA, and one of the most important cryptographers in the world, it would seem to be a no-brainer that he should be present for both conferences. However, he was unable to attend either, because the U.S. took exactly *four* months to send him his new visa. In his apology <http://www.fas.org/sgp/news/2013/10/shamir.html> (dated 15 Oct 2013) for not being able to attend the History of Cryptography conference, Adi notes that "I am not alone, and many foreign scientists are now facing the same situation." Because of the delay, his paper was removed from the program for the History conference. Even though his visa has now arrived long after Crypto 2013, he was reinvited to give the talk at the Cryptology History conference, it is apparently no longer possible due to other commitments. This could be some sort of egregious combination of incredible arrogance, ignorance, stupidity, personal vendetta, diplomatic blunder, and misguided attitude to International scientific collaboration, or possibly just attributable to a serious miscarriage of innate bureaucracy. In any case, the injustice is really sad, because four months for the simple nth renewal of a visa seems outrageous. Indeed, public-key cryptography might not even be with us today if Adi had not been involved with Ron Rivest and Leonard Adleman so long ago. [PGN's personal opinion] ------------------------------ Date: Mon, 14 Oct 2013 10:11:16 -0400 From: Monty Solomon <monty(a)roscom.com> Subject: An App That Saved 10,000 Lives (Amy O'Leary) [Note: RISKS always solicits success stories, particularly those that result from foresight, long-term planning, intelligent software development and software engineering practices, and so on. Here's one. Unfortunately, the norm seems to be that we generally run items on actual cases were the risks are either exacerbated or evidently present, as more or less dominated by the rest of this issue -- because they are predominant. PGN] [Source: Amy O'Leary, *The New York Times*, 5 Oct 2013] While most start-ups feverishly track figures like the total number of users, Ron Gutman, the founder and chief executive of the health information start-up, HealthTap, is more interested in a different data point. This week, the start-up heard from its 10,000th user who said the site saved her life. "My local doctor brushed me off and told me it was anxiety without doing any tests at all," wrote one woman who turned to HealthTap after seeing her doctor. After spending two hours on HealthTap, she was told by a doctor who contributes to the site that her condition sounded like a blocked artery. She soon saw a cardiology specialist who later inserted a coronary stent. Since its founding in 2012, the site has logged nearly a billion questions and answers, from simple queries about headaches or the flu, to more complicated ones, like whether mechlorethamine is a cancer medication. Questions are then routed to a physician who is both an expert in that particular field of medicine, and who is determined by an algorithm to be likely to respond fast, Mr. Gutman said. None of that would be possible without the participation of nearly 50,000 doctors who contribute their advice free. (Every page on the site has a disclaimer saying that the site "does not provide medical advice, diagnosis or treatment.") ... http://bits.blogs.nytimes.com/2013/10/05/how-to-save-10000-lives-with-an-ap… ------------------------------ Date: Sun, 13 Oct 2013 23:16:39 -0400 From: Monty Solomon <monty(a)roscom.com> Subject: From the Start, Signs of Trouble at Health Portal (Pear et al.) Robert Pear, Sharon LaFraniere and Ian Austen. *The New York Times*, dated 12 Oct 2013, published 13 Oct 2013 WASHINGTON - In March, Henry Chao, the chief digital architect for the Obama administration's new online insurance marketplace, told industry executives that he was deeply worried about the Web site's debut. "Let's just make sure it's not a third-world experience," he told them. Two weeks after the rollout, few would say his hopes were realized. For the past 12 days, a system costing more than $400 million and billed as a one-stop click-and-go hub for citizens seeking health insurance has thwarted the efforts of millions to simply log in. The growing national outcry has deeply embarrassed the White House, which has refused to say how many people have enrolled through the federal exchange. Even some supporters of the Affordable Care Act worry that the flaws in the system, if not quickly fixed, could threaten the fiscal health of the insurance initiative, which depends on throngs of customers to spread the risk and keep prices low. ... http://www.nytimes.com/2013/10/13/us/politics/from-the-start-signs-of-troub… ------------------------------ Date: Mon, 14 Oct 2013 10:01:01 -0400 From: Monty Solomon <monty(a)roscom.com> Subject: Deloitte IT projects plagued with troubles around the country (Woolhouse and Healy) 6 Oct 2013 http://www.boston.com/business/technology/2013/10/06/deloitte-projects-plag… Mass. IT project is latest black eye for Deloitte By Megan Woolhouse and Beth Healy | GLOBE STAFF 07 Oct 2013 http://www.bostonglobe.com/business/2013/10/06/deloitte-projects-plagued-wi… State senate committee to hold hearing on troubled Deloitte unemployment system contract October 3, 2013 http://www.boston.com/business/2013/10/03/state-senate-committee-hold-heari… A thousand defects: DOR fired Deloitte in August October 3, 2013 http://www.boston.com/news/local/massachusetts/2013/10/04/thousand-defects-… $54m later, state fired computer contractor By Megan Woolhouse and Beth Healy | GLOBE STAFF 04 Oct 2013 http://www.bostonglobe.com/business/2013/10/03/thousand-defects-dor-fired-d… Massachusetts, California jobless benefit claim woes both tied to Deloitte Consulting of New York 24 Sep 2013 http://www.boston.com/business/news/2013/09/24/troubled-calif-unemployment-… Mass., Calif. benefit claim woes tied to same firm By Megan Woolhouse | GLOBE STAFF 25 Sep 2013 http://www.bostonglobe.com/business/2013/09/24/troubled-calif-unemployment-… Flawed contract for jobless claim system cost state millions By Beth Healy and Megan Woolhouse | GLOBE STAFF 19 Sep 2013 http://www.bostonglobe.com/business/2013/09/18/flawed-contract-leads-flawed… ------------------------------ Date: Sun, 13 Oct 2013 09:43:32 -0700 From: Lauren Weinstein <lauren(a)vortex.com> Subject: Online Application Woes Make Students Anxious and Put Colleges Behind Schedule With early admission deadlines looming for hundreds of thousands of students, the new version of the online Common Application shared by more than 500 colleges and universities has been plagued by numerous malfunctions, alarming students and parents and putting admissions offices weeks behind schedule "It's been a nightmare," Jason C. Locke, associate vice provost for enrollment at Cornell University. "I've been a supporter of the Common App, but in this case, they've really fallen down." http://j.mp/1bPUA3f (*The New York Times* via NNSquad) So, like, this is rocket science to do correctly at these volumes of transactions for relatively straightforward applications? Uh, no. ------------------------------ Date: Sun, 13 Oct 2013 11:43:27 -0700 From: Lauren Weinstein <lauren(a)vortex.com> Subject: Deutsche Telekom hopes to hide German Internet traffic from spies "One of Deutsche Telekom's competitors, Internet service provider QSC, had questioned the feasibility of its plan to shield Internet traffic, saying it was not possible to determine clearly whether data was being routed nationally or internationally, WirtschaftsWoche magazine reported." http://j.mp/1ajC10H (Reuters via NNSquad) What they really mean is foreign spies. Their own vast surveillance apparatus of course would have full access. No matter, it's basically impractical, as noted. ------------------------------ Date: Mon, 14 Oct 2013 08:28:54 -0700 From: Lauren Weinstein <lauren(a)vortex.com> Subject: "We can't let the Internet become Balkanized" (Sascha Meinrath) http://j.mp/1elH7hh (Slate via NNSquad) "Traditionally, that debate has featured America in the role as champion of a free and open Internet, one that guarantees the right of all people to freely express themselves. Arguing against that ideal: repressive regimes that have sought to limit connectivity and access to information. The NSA's actions have shifted that debate, alienating key Internet-freedom allies and emboldening some of the most repressive regimes on the planet. Think of it as an emerging coalition between countries that object to how the United States is going about upholding its avowed principles for a free Internet, and countries that have objected to those avowed principles all along." - - - It is my personal belief that much of the breathless foreign government hyperbole against the US relating to surveillance has little do with actual surveillance (after all, many of these countries have their own major surveillance systems, sometimes focused specifically inward to further political repression and censorship) and everything to do with pushing the abhorrent UN/ITU agenda (or similar agendas) for Internet control that would codify censorship and heavy-handed government directed dictates over Internet content and associated retribution against Internet users. China's and Russia's longstanding duplicity in these respects relating to Internet governance and censorship is particularly noteworthy. ------------------------------ Date: Mon, 14 Oct 2013 13:16:24 -0700 From: Gene Wirchenko <genew(a)telus.net> Subject: "Risk considerations: Tracking services monitor your every move" (Steve Ragan) Steve Ragan, CSO Online, 14 Oct 2013 Tracking services offer no real value to the business, but they exist on networks both large and small, and administrators are often unaware of their presence http://www.csoonline.com/article/741140/risk-considerations-tracking-servic… ------------------------------ Date: Sun, 7 Oct 2012 20:20:16 -0900 From: RISKS-request(a)csl.sri.com Subject: Abridged info on RISKS (comp.risks) The ACM RISKS Forum is a MODERATED digest. Its Usenet manifestation is comp.risks, the feed for which is donated by panix.com as of June 2011. => SUBSCRIPTIONS: PLEASE read RISKS as a newsgroup (comp.risks or equivalent) if possible and convenient for you. The mailman Web interface can be used directly to subscribe and unsubscribe: http://lists.csl.sri.com/mailman/listinfo/risks Alternatively, to subscribe or unsubscribe via e-mail to mailman your FROM: address, send a message to risks-request(a)csl.sri.com containing only the one-word text subscribe or unsubscribe. You may also specify a different receiving address: subscribe address= ... . You may short-circuit that process by sending directly to either risks-subscribe(a)csl.sri.com or risks-unsubscribe(a)csl.sri.com depending on which action is to be taken. Subscription and unsubscription requests require that you reply to a confirmation message sent to the subscribing mail address. Instructions are included in the confirmation message. Each issue of RISKS that you receive contains information on how to post, unsubscribe, etc. => The complete INFO file (submissions, default disclaimers, archive sites, copyright policy, etc.) is online. <http://www.CSL.sri.com/risksinfo.html> *** Contributors are assumed to have read the full info file for guidelines. => .UK users may contact <Lindsay.Marshall(a)newcastle.ac.uk>. => SPAM challenge-responses will not be honored. Instead, use an alternative address from which you NEVER send mail! => SUBMISSIONS: to risks(a)CSL.sri.com with meaningful SUBJECT: line. *** NOTE: Including the string "notsp" at the beginning or end of the subject *** line will be very helpful in separating real contributions from spam. *** This attention-string may change, so watch this space now and then. => ARCHIVES: ftp://ftp.sri.com/risks for current volume or ftp://ftp.sri.com/VL/risks for previous VoLume http://www.risks.org takes you to Lindsay Marshall's searchable archive at newcastle: http://catless.ncl.ac.uk/Risks/VL.IS.html gets you VoLume, ISsue. Lindsay has also added to the Newcastle catless site a palmtop version of the most recent RISKS issue and a WAP version that works for many but not all telephones: http://catless.ncl.ac.uk/w/r <http://the.wiretapped.net/security/info/textfiles/risks-digest/> . ==> PGN's comprehensive historical Illustrative Risks summary of one liners: <http://www.csl.sri.com/illustrative.html> for browsing, <http://www.csl.sri.com/illustrative.pdf> or .ps for printing is no longer maintained up-to-date except for recent election problems. *** NOTE: If a cited URL fails, we do not try to update them. Try browsing on the keywords in the subject line or cited article leads. ==> Special Offer to Join ACM for readers of the ACM RISKS Forum: <http://www.acm.org/joinacm1> ------------------------------ End of RISKS-FORUM Digest 27.54 ************************

1 0

Curious use of cpunks list [Brian Carroll]
by grarpamp 17 Oct '13

17 Oct '13

Please consider writing a whitepaper on the subject of whatever it is you're trying to say and then posting a link to it here with a one paragraph summary for readers. And if you are, or rather than, using this list (as previously surmised by others) as the rough equivalent of your own numbers station, there are surely better places to broadcast this material... nntp, a hidden service webpage, an actual numbers list (which you could ask the cpunks maintainer to set up). Curiosities are presumably welcome here, but really, this? The archives do not indicate much of an audience. Perhaps I've missed something? So I defer to any simple on topic summary and/or explanation which might move others to go back and digest it all for its suggested value and comment therein.

9 8