July 2002 - cypherpunks-legacy

Call for Papers, WORKSHOP ON PRIVACY ENHANCING TECHNOLOGIES 2003
by Adam Shostack 16 Jul '02

16 Jul '02

Please re-distribute as appropriate... ----- Forwarded message from Roger Dingledine <arma(a)mit.edu> ----- CALL FOR PAPERS WORKSHOP ON PRIVACY ENHANCING TECHNOLOGIES 2003 Mar 26-28 2003 Dresden, Germany Hotel Elbflorenz Dresden http://www.petworkshop.org/ Privacy and anonymity are increasingly important in the online world. Corporations and governments are starting to realize their power to track users and their behavior, and restrict the ability to publish or retrieve documents. Approaches to protecting individuals, groups, and even companies and governments from such profiling and censorship have included decentralization, encryption, and distributed trust. Building on the success of the first anonymity and unobservability workshop (held in Berkeley in July 2000) and the second workshop (held in San Francisco in April 2002), this third workshop addresses the design and realization of such privacy and anti-censorship services for the Internet and other communication networks. These workshops bring together anonymity and privacy experts from around the world to discuss recent advances and new perspectives. The workshop seeks submissions from academia and industry presenting novel research on all theoretical and practical aspects of privacy technologies, as well as experimental studies of fielded systems. We encourage submissions from other communities such as law and business that present their perspectives on technological issues. As in past years, we will publish proceedings after the workshop. Suggested topics include but are not restricted to: * Efficient (technically or economically) realization of privacy services * Techniques for censorship resistance * Anonymous communication systems (theory or practice) * Anonymous publishing systems (theory or practice) * Attacks on anonymity systems (eg traffic analysis) * New concepts in anonymity systems * Protocols that preserve anonymity/privacy * Models for anonymity and unobservability * Models for threats to privacy * Novel relations of payment mechanisms and anonymity * Privacy-preserving/protecting access control * Privacy-enhanced data authentication/certification * Profiling, data mining, and data protection technologies * Reliability, robustness, and attack resistance in privacy systems * Providing/funding privacy infrastructures (eg volunteer vs business) * Pseudonyms, identity, linkability, and trust * Privacy, anonymity, and peer-to-peer * Usability issues and user interfaces for PETs * Policy, law, and human rights -- anonymous systems in practice * Incentive-compatible solutions to privacy protection * Economics of privacy systems * Fielded systems and techniques for enhancing privacy in existing systems IMPORTANT DATES Submission deadline December 2, 2002 Acceptance notification February 7, 2003 Camera-ready copy for preproceedings March 7, 2003 Camera-ready copy for proceedings April 28, 2003 CHAIRS Roger Dingledine, The Free Haven Project, USA Andreas Pfitzmann, Dresden University of Technology, Germany PROGRAM COMMITTEE Alessandro Acquisti, SIMS, UC Berkeley, USA Stefan Brands, Credentica, Canada Jean Camp, Kennedy School, Harvard University, USA David Chaum, USA Richard Clayton, University of Cambridge, England Lorrie Cranor, AT&T Labs - Research, USA Roger Dingledine, The Free Haven Project, USA (program chair) Hannes Federrath, Freie Universitaet Berlin, Germany Ian Goldberg, Zero Knowledge Systems, Canada Marit Hansen, Independent Centre for Privacy Protection Schleswig-Holstein, Germany Markus Jakobsson, RSA Laboratories, USA Brian Levine, University of Massachusetts at Amherst, USA David Martin, University of Massachusetts at Lowell, USA Andreas Pfitzmann, Dresden University of Technology, Germany Matthias Schunter, IBM Zurich Research Lab, Switzerland Andrei Serjantov, University of Cambridge, England Adam Shostack, Zero Knowledge Systems, Canada Paul Syverson, Naval Research Lab, USA PAPER SUBMISSIONS Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be at most 15 pages excluding the bibliography and well-marked appendices (using 11-point font and reasonable margins), and at most 20 pages total. Committee members are not required to read the appendices and the paper should be intelligible without them. The paper should start with the title, names of authors and an abstract. The introduction should give some background and summarize the contributions of the paper at a level appropriate for a non-specialist reader. During the workshop preproceedings will be made available. Final versions are not due until after the workshop, giving the authors the opportunity to revise their papers based on discussions during the meeting. Submissions can be made in Postscript or PDF format. To submit a paper, send a plain ASCII text email to <arma(a)mit.edu> containing the title and abstract of the paper, the authors' names, email and postal addresses, phone and fax numbers, and identification of the contact author. To the same message, attach your submission (as a MIME attachment). Papers must be received by December 2, 2002. Notification of acceptance or rejection will be sent to authors no later than February 7, 2003, and authors will have the opportunity to revise for the preproceedings version by March 7, 2003. Submission implies that, if accepted, the author(s) agree to publish in the proceedings and to sign a standard copyright release, and also that an author of the paper will present it at the workshop. ----- End forwarded message ----- --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to majordomo(a)wasabisystems.com

1 0

Herbal Supplements: No Prescription Required 9081
by elenoguerrero＠hotmail.com 16 Jul '02

16 Jul '02

1 0

Re:Atmospheric noise & fair coin flipping
by Major Variola (ret) 16 Jul '02

16 Jul '02

At 01:50 AM 7/16/02 -0700, gfgs pedo wrote: >>The rules of physics are those that don't change >> from time to time, or >> place to place > >i tend to disagree with this. ... >The mathametical observations rely on the parameters >that are taken to make the mathametical model. >if the parameters changes,the mathametical model will >have to be changed and new laws have to be brought. Certainly. Newton *replaced* dead-greek 'physics' but Newton was *subsumed* (ie compatibly refined) by Einstein. If e.g., you could determine that the gravitational constant varies with time, that would have to be added to the model. >with what certainy can we say that additional >parameters will not be added or removed and that the >laws of physics will stay true for ever? We can't say that; but we can only operate as if they were constant. If the laws of physics vary with distance from Sol, for instance, astrophysicists are *fucked* >If a new parameter ever gets added may be two bodies >with mass may repell each other. If evidence supports this then sure, a new quality/quantity may be introduced. Does dark matter have spin :-) >can we say that these parameters will never change? No, but without evidence that they do, Mr. Occam (who had to leave his razor at the security checkpoint) suggests minimizing the number of free variables and trying to work with an assumption of constancy as much as possible.

1 0

Do you feel secured about your job? 4754YoZz2--9
by acir3648g11＠unet.univie.ac.at 16 Jul '02

16 Jul '02

Easy 30-50% Return? Learn how you can receive a monthly check for 3, 4, or 5% a month until your initial investment is paid off...then a monthly check for over 4% a month for years to come... We know it sounds impossible, but it's happening today. For complete information on this multi-trillion dollar industry: http://80.71.65.19 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ To Opt Out: Please go to our "OPT OUT" website: http://80.71.65.19/optout.html

1 0

FW:>Re: Men & Women, Add a little spice to life! 24495
by ejayski＠hotmail.com 16 Jul '02

16 Jul '02

1 0

385-3 vote: House OKs life sentences for hackers
by Elyn Wollensky 16 Jul '02

16 Jul '02

seems the cyber-terrorist FUD is starting to hit the fan ... ;~( e House OKs life sentences for hackers But time may run out for computer crime bill in Senate http://www.msnbc.com/news/780923.asp WASHINGTON, July 15 - The House of Representatives voted overwhelmingly Monday to create a new punishment of life imprisonment for malicious computer hackers. By a 385-3 vote, the House approved a computer crime bill that also expands police ability to conduct Internet or telephone eavesdropping without first obtaining a court order. <snip> "Until we secure our cyber infrastructure, a few keystrokes and an Internet connection is all one needs to disable the economy and endanger lives," sponsor Lamar Smith, R-Tex., said earlier this year. "A mouse can be just as dangerous as a bullet or a bomb." <snip>

1 0

Free Lifetime Passes Teen Mega-Site!
by FreePasses＠sexy-emails.com 16 Jul '02

16 Jul '02

1 0

Super Blue Stuff Pain Relief - On Sale Today!
by Ebargains 16 Jul '02

16 Jul '02

1 0

Re:Atmospheric noise & fair coin flipping
by gfgs pedo 16 Jul '02

16 Jul '02

hi, thanx a lot,there is one more doubt. >The rules of physics are those that don't change > from time to time, or > place to place i tend to disagree with this. the hierarchy goes like okay let us say that two bodies with mass attract each other. it was an observation of a physical body,then we make a mathametical model of the phenomenon. Based on the mathametical model we make laws of physics. The mathametical observations rely on the parameters that are taken to make the mathametical model. if the parameters changes,the mathametical model will have to be changed and new laws have to be brought. with what certainy can we say that additional parameters will not be added or removed and that the laws of physics will stay true for ever? If a new parameter ever gets added may be two bodies with mass may repell each other. can we say that these parameters will never change? Regards Data. --- Optimizzin Al-gorithym <al(a)qaeda.org> wrote: > At 05:45 AM 7/14/02 -0700, gfgs pedo wrote: > >it is said that atmospheric noise is random but how > >can we say for sure. > > Physics, chaos, the growth of initial uncertainty as > systems evolve, > energy/time required to make measurements to > arbitrary precision. > > > >what if the parameters giverning atmospheric noise > >vary frm time 2 time. > > The rules of physics are those that don't change > from time to time, or > place to place. > Certainly the e.g., wind speed does. > > >so can we say atmospheric noise is random or a coin > >flipping is random-only because it passes die hard > >test or other randomness tests-which is an > indicator > >of randomness with the current defenition of > >parameters in determing randomness? > > No, since 'anything through a whitener passes' these > tests. > The integers (0, 1, 2..) fed into DES will pass. > (Equivalently) A low-entropy source fed into a hash > will pass. > > [Historical note: this is why Intel should make its > raw RNG > data available in chips with whitened-output RNG > functions] > > To have a true RNG, You *must* have a physical > understanding of the > source > of entropy whence you distill the pure bits (whether > or not > you feed it into a whitener after distillation). > Precisely > because a 'black box' may be a deterministic (if you > know > the secret) PRNG. By 'distill' I mean reduce N bits > to M, > N > M, in such a way as to increase the entropy of > the > resultant M bits. > > > >is there truly random or that we can say with > certain > >degre of confidence that they are nearly random as > all > >current evidence poits so. > > 'Random' should be taken to mean 'ignorant of'. It > suffices > that we (and our adversary) are ignorant of the > detailed conditions > inside a noise diode, unstable atomic nucleus, > atmospheric > (or FM radio) noise receiver, etc. Philosophical > discussions about > 'true > randomness' ("Is there a deeper/smaller level of > description in > which apparently-random events are based or emerge > from?") > are beyond the scope of this rant. > __________________________________________________ Do You Yahoo!? Yahoo! Autos - Get free new car price quotes http://autos.yahoo.com

2 1

企业低廉的宣传手段 cypherpunks
by biginvestment 16 Jul '02

16 Jul '02

If you can't read the email,please click here http://www.jjyx.com/serve/advertise.htm Thank you ×ðŸŽµÄÏÈÉú/Å®Ê¿£º ÒøºÓÖ®ÐÇ¹ãžæ·þÎñ£º ¿ÉÔÚÈ«¹úÄËÖÁÊÀœç·¶Î§·¢²ŒÐÅÏ¢£¬Í¶·Å¹ãžæ¡£ Ò» ¹ãžæÓÊŒþ£º¿ÉžùŸÝÄúµÄÐèÒª£¬ÔÚ¹úÄÚÖž¶šÇøÓò£¬µØµã»òÐÐÒµœøÐÐ¹ãžæÓÊŒþÐÅÏ¢·¢²ŒµÈ¡… ÎÒÃÇÓµÓÐ°ŽÈ«¹úµØÇø£¬ÐÐÒµ·ÖÀàÊýÇ§ÍòÓÊŒþµØÖ·Œ°ÍêÉÆµÄ·¢²ŒÏµÍ³£¬ËæÊ±ÎªÄãÌá¹©ÂúÒâµÄ·þÎñ¡£»úÓöÄÑµÃ£¬žÏ¿ìÐÐ¶¯°É£¬ÈÃÄãµÄÆóÒµ£¬¹«ËŸÁ¢ŒŽÕÆÎÕÉÌ»úŽ«ÃœµÄÃüÂö------¹ãžæE-MAIL¡£ ¶þ 70ÖÖ×îÐÂÖøÃûÓÊŒþËÑË÷£¬Èº·¢£¬·Öžî£¬ÑéÐ§ÈíŒþ¡£ÈÃÄúÄÜ¶ÌÊ±ŒäÔÚ»¥ÁªÍøÉÏÖž¶šËÑŒ¯È… Èý ËÑË÷ÒýÇæ×¢²á °ïÄãµÇÂœÈ«Çò6000Ó¢ÎÄËÑË÷ÒýÇæ(ÈçYAHOO£¬GOOGLEDµÈ)£¬œø200žöÖÐÎÄËÑË÷ÒýÇæ(ÈçÍøÒ×£¬ÑÅ»¢£¬ÏãžÛÌíŽïËÑË÷µÈ)¡£ÈÃÄãµÄÍøÕŸÏíÓþÈ«Çò¡££š³¬Öµ·þÎñ£¬ÌØ»ÝŒÛ400£© ËÄ ÍøÂçÐÅÏ¢·¢²Œ£ºÒøºÓÖ®ÐÇ¿ÉÒÔœ«ÄúµÄÏúÊÛ£¬¹ºÂò£¬ÕÐÉÌ»òºÏ×÷µÈÉÌÒµÐÅÏ¢×Ô¶¯·¢²ŒµœÊÀœçÖªÃûµÄ3300¶àžöÃ³Ò×¹«žæ°åºÍ¹úÄÚÉÏÇ§žöBBS£¬ÂÛÌ³¹«žæµÈ¡£×îŽóÏÞ¶ÈÌáÉýÄãµÄÉÌÒµ»ú»á¡££š³¬ÖµŒÛ350Ôª£© µç×ÓÓÊŒþÈº·¢·þÎñÇëŒû£ºhttp://www.jjyx.com/serve/advertise.htm µç×ÓÓÊŒþÈº·¢£¬ËÑË÷ÈíŒþ³öÊÛÇëŒû£ºhttp://www.jjyx.com/serve/advertise2.htm ÇëÎðÖ±œÓ»ØžŽ£¬ÓÐÒâÕßÇëÀŽÐÅemail£º serve(a)jjyx.com ³ÏÑûž÷œçÅóÓÑÇ°ÀŽÇ¢ÌžºÏ×÷¡£ ÖÂ Àñ ÒøºÓÖ®ÐÇ If you can't read the email,please click here http://www.jjyx.com/serve/advertise.htm Thank you

1 0