- tor-dev - lists.torproject.org

First five Tor tech reports
by Karsten Loesing 27 Aug '12

27 Aug '12

Hi Roger, hi Nick, here are the first five metrics tech reports that I'd like to turn into Tor tech reports (see #5405 for the idea behind this). If you agree that this is a good idea, I'll push the sources to tech-reports.git and put the PDFs on the Tor website. I need your confirmation for each report as part of the process, though. - https://people.torproject.org/~karsten/volatile/bridge-stability-2011-10-31… - https://people.torproject.org/~karsten/volatile/blocking-2011-09-15.pdf - https://people.torproject.org/~karsten/volatile/detector-2011-09-09.pdf - https://people.torproject.org/~karsten/volatile/relay-stability-2011-06-30.… - https://people.torproject.org/~karsten/volatile/data-2011-03-14.pdf Thanks, Karsten

6 15

https://gitweb.torproject.org/check.git
by bgt56zhn＠Safe-mail.net 26 Aug '12

26 Aug '12

Where is the code powering check.torproject.org? There is https://gitweb.torproject.org/check.git, but the repo has no commits. Thanks

3 2

an alternate MyFamily definition
by tagnaq 24 Aug '12

24 Aug '12

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Hi, when requesting a new group by feature for compass [1] (#6662 [2]) I discussed with Karsten about how to handle asynchronous/overlapping families: karsten: > Here's an example. Assume we have three relays: A, B, and C. These > relays state the following family relationships: > > A: A, B B: A, B, C C: B, C > > We require mutual agreement about being in the same family, so we > could either come up with family A, B or with family B, C. Which > one is correct? I proposed to go with family = A, B, C because there is a mutual agreement between A<->B and B<->C. A and C agreed to be in a family with B, and B agreed to be in a family with A and C. Such configurations can be found in the wild mostly due to incomplete MyFamily configurations on relays in big families. As every big relay operator knows configuring families is a non-trivial effort with a growing number of relays. Now I thought about it and wanted to suggest this MyFamily interpretation as an alternate approach to the fully mutual setup where *every* relay must be reconfigured as opposed to just two of them. Why? This would reduce the configuration effort required when adding a new relay to *two* relays regardless of how many relays are in your family. Now, the MyFamily configuration overhead for big families is a well known problem so I suppose someone else did already propose this approach? What do you think about it? [1] https://compass.torproject.org [2] https://trac.torproject.org/projects/tor/ticket/6662 a additional example to make this clearer: A: A, B, C B: A, B, C C: A, B, C D: A, B, C, D family = A, B, C A family member must have a *mutual* agreement with at least *one* node. -----BEGIN PGP SIGNATURE----- iF4EAREKAAYFAlA2YkoACgkQyM26BSNOM7Yp2wD/VTBw8BmUJlRZtIfXahIGX+t0 zwzP6MfRDwgPCsQMeEUA/3dUyyoq91Fx4lmihWHis2DZNAoM/CHh2MnwgMNL/W1W =FWRU -----END PGP SIGNATURE-----

3 4

[GSoC] [Stegotorus] Pencil down
by vmon 23 Aug '12

23 Aug '12

Hey Zack, I just did my last pushes before putting my pencil down for the final evaluations. They take care of the followings: - The remaining of all your comments on the github. Except for "always use xalloc instead of new". I have used new extensively for instantiating objects. What's exactly about xalloc that's better than new, if you have overloaded both of them? - Documenting the http_apache steg protocol. The tl_oneway_c2s fails the http-proxy test. It still have problem with one-sided EOF. It used to pass when I allow the one way socket shutdown in the http proxy. So, I think stegotorus still have problem with EOF management. You might want to look at it when you have time. Happy moving! vmon

2 1

Tor and NAT devices: increasing bridge & relay reachability or, enabling the use of NAT-PMP and UPnP by default.
by Jacob Appelbaum 22 Aug '12

22 Aug '12

Hi, My latest tech report is now up. I think it would be a nice idea if we could kick off a discussion about Tor, NAT devices and reachability. Tor and NAT devices: increasing bridge & relay reachability or, enabling the use of NAT-PMP and UPnP by default: https://research.torproject.org/techreports/tor-nat-plan-2012-08-22.pdf Feedback welcome and encouraged! All the best, Jake

1 0

[ooniprobe-dev] Summary of OONI hackfest
by Arturo Filastò 22 Aug '12

22 Aug '12

We had a mini hackfest at noisebridge on OONI and this thread is to summarize what we discussed. mct: feel free to add things from your notes that are not detailed here. One of the problems that we mostly focused our attention on was how to detect censorship on HTTP when the user is presented with a block page. The reason for focusing on this is that censorship over HTTP is the most prevalent form. # Detecting censorship in web sites Detecting that the presented web page is not the expected site, but is a censorship page turns out to be a non trivial task, especially when you are dealing with web pages that have dynamic content. This problem is detailed in this trac ticket: https://trac.torproject.org/projects/tor/ticket/6180. We ended up dividing the possible approaches into two macro categories: Statistical and Heuristic [1] One of the properties we would like our classifier to have is that that a user should be able to detect that the presented page is the block page by just having a copy of OONI and some data that can be given to them over a non censored channel (sneakernet for example). ## DOMClass, a eigenvalue based statistical classifier What we ended up implementing is a classifier that considers the DOM structure of the web page. We can easily build such a database of the DOM structure features of the websites we are interested in analyzing and ship these to users. This is how the algorithm works: This classifier uses the DOM structure of a website to determine how similar the two sites are. The procedure we use is the following: * First we parse all the DOM tree of the web page and we build a list of TAG parent child relationships (ex. <html><a></a><c></c></html> => (html, a), (a, b), (html, c)). * We then use this information to build a matrix (M) where m[i][j] = P(of transitioning from tag[i] to tag[j]). If tag[i] does not exists P() = 0. Note: M is a square matrix that is number_of_tags wide. * We then calculate the eigenvectors (v_i) and eigenvalues (e) of M. * The corelation between page A and B is given via this formula: correlation = dot_product(e_A, e_B), where e_A and e_B are resepectively the eigenvalues for the probability matrix A and the probability matrix B. You will note that the Matrix we are computing eigenvalues for somewhat resembles a Markov model for transitions between DOM element X to Y. This algorithm appears to work pretty well even on highly dynamic web sites (such as the homepage of news.google.com) Problems with this algorithm: * It does not take into account the global position of DOM elements or how deeply nested they are. (<a><a></a></a> (a,b),(b,a),(a,b) is equivalent to <a><a></a></a><a></a> (a,b), (b,a), (a,b)) Looking into other possible solutions to this problem I took a look at algorithms that are used to compute graph similarity. This problem could be solved by using an algorithm that calculates the maximum isomorphic subgraph, but this problem is NP-hard. [2] I am unsure if the computation effort to use algorithms along these lines is worth while. I can't seem to find the notes on the rest of the discussion, perhaps mct will integrate with this discussion. - Art. [1] https://trac.torproject.org/projects/tor/ticket/6180#comment:3 [2] <http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem>http://en.wikipedia.org/wiki/Maximum_common_subgraph_isomorphism_problem

1 0

[GSoC] APAF Report
by Michele Orrù 21 Aug '12

21 Aug '12

Hello, As Daniel suggested, I'm writing this email to keep you updated on my Google Summer of Code Project - APAF. Following the hackathon of the 18-21 May, we reached a working build environment, and a primitive administration page. Below follows a brief update about what is the current status of the software: Development: I've defined what a service really is in terms of implementation, and approached the administration service (the "panel") in such a way that any future application may hide or completely override it. This shall give not only a comfortable user experience but also elasticity to the software. Testing: unittests cover most of the software, but even though APAF is still in an embrional state, I would be glad anyway to receive some feedbacks from you, about which OS the apaf was tested on and any bug you were able to find. Documentation: currently is disorganized, and splitted between sphynx and github wiki. But, the data is there, and I promise that on the next days I will merge/rewrite the two :) Anyway, the code is highly documented, in my opinion the generated sphynx documentation is acceptable. Deployment: I kept working on the build system, which at the current revision works on windows, osx and as vanilla python .egg., but there are still some issues - for example, the automation of .deb build and blobbing external tools on windows. In case you need a quick link to the project, https://github.com/mmaker/apaf -- ù

4 15

IRC meeting to plan sponsor L milestones on Wed July 18, 15:00 UTC in #tor-dev
by Karsten Loesing 15 Aug '12

15 Aug '12

Hi everyone, we have an upcoming sponsor contract starting on October 1, 2012 and running until August 31, 2013. To be precise, this contract is not signed yet, but it's very likely to happen. The general deliverables are already defined, but we can suggest which parts we plan to have done by which milestone. The deliverables can be found here: https://trac.torproject.org/projects/tor/wiki/org/sponsors/SponsorL I suggest we have an IRC meeting with all developers who'll be involved in this contract. Deliverables are, of course, not yet assigned to developers. Here are the people who probably should be at the meeting (with most relevant deliverable numbers in parentheses): - Aaron (4) - Erinn (9, 10) - George (1, 2, 3) - Jake (10) - Karsten (2) - Mike (8) - Nick (3) - Runa (5, 6, 7) - Sebastian (9) - Tomas (9) The meeting will happen July 18, 15:00--17:00 UTC in #tor-dev. The main goal of the meeting is to decide on good milestones for December 31, March 31, June 30, and August 31 that will go into the contract. If somebody cannot make the meeting, please talk to me about their possible deliverables before or shortly after the meeting. (If too many people cannot make the meeting, we may reschedule it, but for the moment, let's aim for the date written above.) Thanks, Karsten

5 12

My RSA-PM client-server
by Daniel Dennis 14 Aug '12

14 Aug '12

Last month I posted a message titled "Encrypted PM site/hidden service" inquiring about websites or services that allow users to write messages. I got a few interesting replies but none did exactly what I wanted. So I wrote up this code and put it on github. The major things to note are - Supports Windows and Linux (likely mac as well) - Written in C# .NET - Has a mono and non mono (plain windows) build - Is written in mind to NEVER TRUST THE SERVER - Client has the contents (re-)encrypted in a local database I spent some time ensuring it works perfectly. I was able to reach the server when it was behind a hidden service, I ran client and server on linux and windows. Everything worked as expected. https://github.com/sdjfjsdfiuhszduh/RSA-PM I don't want to host anything myself. It would be nice if someone could so whistle blowers could talk to others securely. If anyone goes through the code let me know what you think. Although I wrote it quickly so it may be confusing to others. -- http://www.fastmail.fm - IMAP accessible web-mail

1 0

Pyonionoo
by Norman Danner 14 Aug '12

14 Aug '12

Hi Karsten, We have a preliminary version of the Pyonionoo front-end at git://github.com/meganchang/pyonionoo.git Make sure to look at the database branch. We'd be happy to hear feedback. Unfortunately, this isn't as far as we wanted to be. A run-down of the main open issues: * We ran into issues with getting sqlite in-memory databases to play nicely with multiple threads (stop-gap solution: use an on-disk database). * Right now it just has the summary handler, though adding the other handlers probably isn't a problem (probably a bit of minor refactoring). * The search GET parameter isn't implemented yet, in part because we realized that implementing it as specified in the protocol isn't so straightforward, at least in SQLite (which does not, in an obvious way, support searching for initial substrings). - Norman -- Norman Danner - ndanner(a)wesleyan.edu - http://ndanner.web.wesleyan.edu Department of Mathematics and Computer Science - Wesleyan University

3 6