Dear all,

The submission server for ACM DRM 2008 is open (submission deadline:
May 23). Details follow.

Best regards,
-Greg and Marc.

----------------------------------------------------------------------
Call for Papers

EIGHTH ACM DRM WORKSHOP
(Co-located with ACM-CCS 2008, Alexandria, Virginia, USA)

http://www.ece.unm.edu/DRM2008/

Submission deadline: May 23, 2008
Workshop: October 27, 2008 - Alexandria, Virginia, USA
----------------------------------------------------------------------

Is there any correlation between difficulty of statistical and
algebraic analysis ?

If cipher X can be expressed as more complex algebraic equation than
cipher Y then does cipher X tend to has better statistical
(differential or linear) characteristic than cipher Y ?

---------------------------------------------------
Apologies if you received multiple copies of this posting.
---------------------------------------------------
*** CALL FOR PAPERS ***

4th International Workshop on Storage Security and Survivability
StorageSS 2008
ACM CCS 2008 Workshop
Oct. 31, 2008
George Mason University
http://storagess.org/2008/

IMPORTANT DATES:
- Submissions due: May 23
- Notification: July 3
- Camera-ready due: August 3

i would like to ask if anyone know how i can find following papers :

H. Rubin,R.Sitgreaves, "Probability distributions related to random
transformations on a finite set" Tech. Rept. Stanford University,1954.

Jay E.Folkert "the distribution of the number of components of a
random mapping function" unpublished PhD. Dissertation, Michigan State
University,1955..

F i r s t C a l l F o r P a p e r s

13th European Symposium on Research in Computer Security (ESORICS'08)
6-8 October, 2008
Malaga, Spain

http://www.isac.uma.es/esorics08/

Papers offering novel research contributions in any aspect of computer
security are

solicited for submission to the Thirteenth European Symposium
on Research in Computer Security (ESORICS 2008). Organized in a series
of European

countries, ESORICS is confirmed as the European
research event in computer security. The symposium started in 1990 and
has been held on

alternate years in different European countries and
attracts an international audience from both the academic and
industrial communities. From

2002 it has been held yearly. The Symposium has
established itself as one of the premiere, international gatherings on
Information

*****

50th International Symposium ELMAR-2008

*****

10-13 September 2008,
Zadar, CROATIA

Paper submission deadline: March 03, 2008

http://www.elmar-zadar.org/

CALL FOR PAPERS AND SPECIAL SESSIONS

TECHNICAL CO-SPONSORS

IEEE Region 8
EURASIP - European Assoc. Signal, Speech and Image Processing
IEEE Croatia Section
IEEE Croatia Section Chapter of the Signal Processing Society
IEEE Croatia Section Joint Chapter of the AP/MTT Societies

CONFERENCE PROCEEDINGS INDEXED BY

IEEE Xplore
INSPEC

POST-CONFERENCE JOURNAL SPECIAL ISSUES AND SPRINGER BOOK
(only selected best papers)

Hi,all, maybe I post a non-sense topic.But when I learned zero-
knowledge proof, I wonder why there is nothing about semi-knowledge
proof,or maybe quantitive-knowledge proof? Then I came to the
literature,I only found something about knowledge complextiy of proof
writen by Bellare and Goldreich.
In an interactive proof system,a zero -knowledge proof system require
the prover give nothing about witness via proving something
validly .Maybe we can define semi-knowlege proof system as
following :When the prover proves something, We allow the prover leak
some knowledge to the verifier, but not the hardcore knowledge.Maybe
this form of semi-knowledge proof is equal to zero-knowledge proof
with auxiliary input.But in some situations ,
these two notions are not same.Maybe we can improve the...

Dear all

Please see below the call for participation for ASIACRYPT 2007,
the 13th Annual International Conference on the Theory and Application
of Cryptology & Information Security.
Program with paper details is also included.

Raphael Phan
ASIACRYPT 2007 General Chair

---
Dates: December 2 - 6, 2007
Venue: Kuching, Sarawak, Malaysia

http://www.swinburne.edu.my/asiacrypt2007/

Conference Information:
ASIACRYPT, the International Conference on the Theory and Application
of Cryptology and Information Security, is one of the three major
cryptology conferences sponsored

annually by the International Association for Cryptologic Research
(IACR), featuring latest breakthrough research in cryptology and
information security. ASIACRYPT 2007

Hi,
I would like to know if make sense the statement "Reversible hashing".
I mean is possible to develop a hash algorithm, or better a digest
algorithm, (variable input lenght, fixed output lenght) that do not
respect the rule to be one-way. I don't want to compare with other
hash algo such SHAx, MDx ecc... but, it can be done?
Just for curiosity; I think this question can be some kind of
interesting discussion, I am wrong?

Oh, sorry for my bad english ;-).

Cheers,
Federico.

Hello,

I am a 20 year old german student and hobby cryptographer, with
strong interests in public key algorithms, cryptographic protocolls
and cryptanalysis. In the year 2003 I came up with a new signature
scheme based on the closest vector problem. This scheme was successfully
presented at germans biggest youth science fair "Jugend Forscht" and one
year later at the Intel ISEF (International Science and Engineering Fair)
in Phoenix, Arizona.

By now, I have not only added an public key encryption algorithm but
also analyzed the algorithm for weaknesses. Hence, the time has come,
where this algorithm has to be presented to a great audience to analyze
it even further.

Here is a first small (and simplyfied) overview: In order to get a
new type of public key encryption algorithm, that is not based on the
factoring problem or the discrrete logarithm in finite fields, we have
to find a suitable hard mathematical problem.