[fc] Financial Cryptography 2003 CFP

2002-07-26 Thread R. A. Hettinga


--- begin forwarded text


Status: RO
From: Rebecca Wright [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Reply-To: [EMAIL PROTECTED]
Subject: [fc] Financial Cryptography 2003 CFP
Sender: [EMAIL PROTECTED]
Date: Wed, 24 Jul 2002 23:13:20 -0400 (EDT)


Call for Papers
Financial Cryptography '03

January 27-30, 2003
La Creole Beach Hotel, Gosier, Guadeloupe

Sponsored by the International Financial Cryptography Association

Original papers are solicited on all aspects of financial data
security and digital commerce for submission to the Seventh Annual
Conference on Financial Cryptography (FC '03). FC '03 brings together
researchers in the financial, legal, cryptologic, and data security
fields to foster cooperation and exchange of ideas. Relevant topics
include:

  Anonymity Infrastructure Design
  Auctions  Legal and Regulatory Issues
  Audit and AuditabilityPayments and Micropayments
  Authentication and Identification Peer-to-Peer Systems
  Certification and Authorization   Privacy
  Commercial Transactions and Contracts Reputation Systems
  Digital Incentive Systems Risks Management
  Digital Rights Management Secure Banking
  Identity Management   Smart Cards
  Implementation Issues Trust Management
  Information Economics Watermarking

We are particularly interested in novel approaches, such as
game-theoretic or economic approaches, to these topics.
Instructions for Authors: Complete papers (or complete extended
abstracts) must be at most fifteen (15) single-spaced standard pages
in length and must be received by 23h59 EST on September 13, 2002. All
papers must be submitted electronically. (In exceptional
circumstances, paper submissions can be accepted, but special
arrangements must be made with the program chairs prior to September
1, 2002.) Papers must be in either standard PostScript or PDF format,
and should be submitted electronically according to the instructions
at http://ifca.ai/fc03/ prior to the deadline. Submissions in formats
other than PostScript or PDF, including word processor source formats
such as MS Word or LaTeX, will be rejected.

Submitted papers should include on the first page the title, all
authors and their affiliations, a brief abstract, and a list of
topical keywords. Papers must describe original work. Submission of
previously published material and simultaneous submission of papers to
other conferences or workshops with proceedings is not
permitted. Authors of papers found to be double submissions risk
having all their submissions withdrawn from consideration, as well as
any other appropriate sanctions.

Proposals for panels are also solicited, and should include a brief
description of the panel as well as prospective participants. Panel
proposals should also be submitted electronically, in plain ASCII
format.

The conference proceedings containing all accepted papers will be
published in the Springer-Verlag Lecture Notes in Computer Science
(LNCS) series after the conference. A pre-proceedings containing
preliminary versions of the papers will be distributed at the
conference.

Important Dates:

  Conference   January 27 - 30, 2003
  Submission deadline  September 13, 2002, 23h59 EST
  Author notification  November 11, 2002
  Pre-proceedings version due  December 16, 2002
  Proceedings version due  March 31, 2003

General Chair: David Pointcheval (Ecole Normale Superieure)

Program Chairs: Jean Camp (Harvard University) and Rebecca Wright
(Stevens Institute of Technology)

Program Committee:

Chris Avery (Harvard Universiy) Helger Lipmaa (Helsinki University of
Technology)
Dan Burk (University of Minnesota)  Dahlia Malkhi (Hebrew University of
Jerusalem)
Lorrie Cranor (ATT Labs)   Satoshi Obana (NEC)
Carl Ellison (Intel Labs)   Andrew Odlyzko (University of Minnesota)
Ian Goldberg (Zero Knowledge)   Benny Pinkas (DIMACS)
John Ioannides (ATT Labs)  Jacques Stern (Ecole Normale Superieure)
Markus Jakobsson (RSA Laboratories) Gene Tsudik (U. C. Irvine)
Ari Juels (RSA Laboratories)









___
fc mailing list
[EMAIL PROTECTED]
http://mail.ifca.ai/mailman/listinfo/fc

--- end forwarded text


-- 
-
R. A. Hettinga mailto: [EMAIL PROTECTED]
The Internet Bearer Underwriting Corporation http://www.ibuc.com/
44 Farquhar Street, Boston, MA 02131 USA
... however it may deserve respect for its usefulness and antiquity,
[predicting the end of the world] has not been found agreeable to
experience. -- Edward Gibbon, 'Decline and Fall of the Roman Empire'

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



[Mac_crypto] Hello and welcome back

2002-07-26 Thread R. A. Hettinga


--- begin forwarded text


Status: RO
To: [EMAIL PROTECTED]
From: Vinnie Moscaritolo [EMAIL PROTECTED]
Subject: [Mac_crypto] Hello and welcome back
Sender: [EMAIL PROTECTED]
Date: Fri, 26 Jul 2002 16:18:03 -0700

hello everyone and welcome back to the new and improved Mac Crypto list.
we are now running on a (sigh) Mac OS-X system with postfix/mailman etc.

I would first like to remind all that the list address has changed to
mac_crypto
from mac-crypto.. a subtle but necessary change.. A little bird tells me that
  we will have some exciting macintosh crypto news in the next few weeks
so stay tuned.. and in the meantime enjoy the list!




-- 

Vinnie Moscaritolo  ITCB-IMSH
PGP: 3F903472C3AF622D5D918D9BD8B100090B3EF042
---
___
mac_crypto mailing list
[EMAIL PROTECTED]
http://www.vmeng.com/mailman/listinfo/mac_crypto

--- end forwarded text


-- 
-
R. A. Hettinga mailto: [EMAIL PROTECTED]
The Internet Bearer Underwriting Corporation http://www.ibuc.com/
44 Farquhar Street, Boston, MA 02131 USA
... however it may deserve respect for its usefulness and antiquity,
[predicting the end of the world] has not been found agreeable to
experience. -- Edward Gibbon, 'Decline and Fall of the Roman Empire'

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



Re: building a true RNG (was: Quantum Computing ...)

2002-07-26 Thread Enzo Michelangeli

- Original Message -
From: [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Tuesday, July 23, 2002 1:59 PM
Subject: Re: building a true RNG (was: Quantum Computing ...)


 You cannot measure entropy retrospectively.  You need to have a
 theory as to where the entropy is coming from, in order to
 reliably measure it.

 Thus hardware sources should be based on simple and well
 understood physical principles, such as Johnson noise or shot
 noise.

 Entropy is not quite a physical quantity -- rather it is on the
 slippery edge between being a physical thing and a philosophical
 thing. If you are not careful, you will slip into a deep epistemic
 bog and find yourself needing to ask how do we know what is
 knowable, and what is the whichness of why?

 To avoid such deep waters, know where your entropy is coming from.

Actually, the aura of mystery that surrounds entropy can be cleared if you
think of it as the amount of information describing the state of a system
that you do NOT know, because the output of the system only allows to
inspect part of its state (or nothing at all). For a perfect PRNG, that
doesn't leak any incremental information about the internal state, the
entropy equals the number of independent bits of its state (which is why I
consider the depletion of the entropy pool a non-issue: if no information
about the state is disclosed though the output stream, the entropy of the
generator CANNOT be decreased). Macroscopic thermodynamic systems contain
much larger amounts of entropy, in the region of 10^23 bits, as the number
of Avogadro comes into play.

Whereas, in theory, even a perfect PRNG can be reverse engineered (e.g.,
hooking a debugger to its software and/or hardware), for a true RNG this is
not possible, either because the number of states is just too large (thermal
noise, see above) or because of quantum reasons (no hidden variables at
all to dig out: for example, to the best of our knowledge there is simply no
way of knowing exactly when a radioactive nucleus will decay). Otherwise,
their black box functionality is essentially the same - by definition.

Estimating an _upper boundary_ to entropy by simply observing the output of
a black box is possible, but under some conditions: you have to assume that
the the system is ergodic, i.e. that the statistics can be inferred from
time averages (or, equivalently, that the system never gets locked into
sequences of some subset of states). And even then, what you have is just
an estimate: you could have a sequence of 1000 consecutive zeroes just by
chance (if you are VERY, VERY unlucky, that is).

Enzo







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