http://www.nnseek.com/e/sci.crypt.research/ Posts for sci.crypt.research Sat, 10 May 2008 06:10:14 PDT http://www.nnseek.com/ http://www.nnseek.com/img/64.png 64 64 NNSeek http://www.nnseek.com/e/sci.crypt.research/acm_drm_2008_submission_server_open_104100890t.html http://www.nnseek.com/e/sci.crypt.research/acm_drm_2008_submission_server_open_104100890t.html
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
----------------------------------------------------------------------

The ACM Workshop on Digital Rights Management is an international
forum that serves as an interdisplinary bridge between areas that can
be applied to solving the problem of Intellectual Property protection
of digital content. These include: cryptography, software and
computer systems design, trusted computing, information and signal
processing, intellectual property law, policy-making, as well as
business analysis and economics. Its purpose is to bring together
researchers from the above fields for a full day of formal talks and
informal discussions, covering new results that will spur new
investigations regarding the foundations and practices of DRM.


This year's workshop, the eighth in the series, continues this
tradition. As in the previous editions, it is sponsored by ACM SIGSAC
and is held in conjunction with the ACM Conference in Computer and
Communications Security (CCS).

Topics of interest include but are not limited to:
* anonymous publishing, privacy and DRM
* architectures for DRM systems
* business models for online content distribution, risk management
* copyright-law issues, including but not limited to fair use
* digital goods and online multiplayer games
* digital policy management
* DRM and consumer rights, labeling and competition law
* implementations and case studies
* information theory and combinatorics, including marking assumptions
and related codes
* robust identification of digital content
* security issues, including but not limited to authorization,
encryption, tamper resistance, and watermarking
* regulatory authority for DRM, interoperability
* supporting cryptographic technology including but not limited to
traitor tracing, broadcast encryption, obfuscation
* threat and vulnerability assessment
* trusted computing, attestation, hardware support for DRM,
side-channels
* usability aspects of DRM systems
* web services related to DRM systems


IMPORTANT DATES

Submission deadline: May 23, 2008
Notification of acceptance: July 10, 2008 Camera-ready version: August
8, 2008
Workshop: October 27, 2008


INSTRUCTIONS FOR AUTHORS

Submissions must not overlap with papers that have been published or
that are simultaneously submitted to a journal or a conference with
proceedings. Submissions should be at most 15 pages excluding the
bibliography and well- marked appendices, using at least 11-point font
and reasonable margins. Committee members are not required to read
the appendices, and thus submissions should be intelligible without
them. Each submission should start with the title, abstract, and names
and contact information of authors. All submissions will be handled
electronically. For submission instructions and further information
please point your web-browser to:

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


PROCEEDINGS

Accepted papers will be published in an archival proceedings volume by
ACM Press and will be distributed at the time of the workshop.


ORGANIZATION

Program Chairs
- Gregory Heileman (U. New Mexico, USA)
- Marc Joye (Thomson, France)

Program Committee
- Olivier Billet (Orange Labs, France)
- Xavier Boyen (Voltage, USA)
- Alain Durand (Thomson, France)
- Rudiger Grimm (U. Koblenz, Germany)
- Bill Horne (Hewlett-Packard, USA)
- Hongxia Jin (IBM, USA)
- Aggelos Kiayias (U. Connecticut, USA)
- David Kravitz (Motorola Labs, USA)
- Brian LaMacchia (Microsoft, USA)
- William Lehr (MIT, USA)
- Nasir Memon (Polytechnic U., USA)
- Fernando Perez-Gonzalez (U. Vigo, Spain)
- Rei Safavi-Naini (U. Calgary, Canada)
- Bin Zhu (Microsoft, China)

General Chair
- Peng Ning (NCSU, USA)
(also General chair for ACM-CCS 2008)

Steering Committee
- Joan Feigenbaum (Yale U., USA)
- Aggelos Kiayias (U. Connecticut, USA)
- Rei Safavi-Naini (U. Calgary, Canada)
- Tomas Sander (Hewlett-Packard, USA)
- Moti Yung (Google & Columbia U., USA)

Posted In: sci.crypt.research

no comments

Reply

]]> Sat, 10 May 2008 06:10:14 PDT http://www.nnseek.com/e/sci.crypt.research/correlation_between_statistical_and_algebraic_analysis_103454746t.html http://www.nnseek.com/e/sci.crypt.research/correlation_between_statistical_and_algebraic_analysis_103454746t.html 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 ?

Posted In: sci.crypt.research

no comments

Reply

]]> Sun, 04 May 2008 11:59:51 PDT http://www.nnseek.com/e/sci.crypt.research/cfp_storagess_08_103427866t.html http://www.nnseek.com/e/sci.crypt.research/cfp_storagess_08_103427866t.html
---------------------------------------------------
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

The 4th ACM International Workshop on Storage Security and
Survivability (StorageSS 2008) will bring together researchers in
storage systems, computer and network security, and cryptography. We
encourage paper submissions from both research and industry presenting
novel ideas on all theoretical and practical aspects of protecting
data in storage and file systems.

TOPICS OF INTEREST include, but aren't limited to:
* storage protection tradeoffs
* storage protection deployment (including case studies)
* smart storage for security and/or survivability
* analysis of covert storage channels and leaks
* mobile storage protection
* novel backup protection techniques
* protection using versioning
* storage encryption techniques (modes of operation,
fast software/hardware encryption)
* key management techniques
* encrypted keyword search and database query
* security analysis of deployed file/volume encryptor, encrypted
disc
* tamper-evident storage protection techniques
* immutable storage protection techniques, provenance
* storage threat models
* storage intrusion detection systems
* security for long-term / archival storage
* privacy and trust issues in (untrusted) remote/hosted storage
* TPM and storage security

The StorageSS workshop solicits full papers of up to 12 pages long as
well as short papers / work-in-progress, which may be up to 6 pages
long. Wild and controversial ideas are especially encouraged. The
workshop will be structured to focus on face-to-face discussion and
integration of people from storage, security, industry, and the open
source community. To foster this interaction, we will include invited
talks and/or panels.

Paper submission and review will be done online. Papers should be
formatted as two column in a font no smaller than 10
points. Submissions should be labeled as either a full paper (up to 12
pages) or short paper (up to 6 pages).

Conference proceedings will be published by the ACM and made available
at the workshop. Authors of accepted papers must guarantee that their
paper will be presented at the workshop.

Submission site:
http://www.easychair.org/conferences/?conf=storagess2008

Please contact the program chair at chair08 [at] storagess.org if you
have any questions about the relevance of a paper or topic.

Program Co-chairs
* Yongdae Kim (University of Minnesota, USA)
* Bill Yurcik (University of Texas at Dallas, USA)

Program Committee
* Giuseppe Ateniese (Johns Hopkins Univ., USA)
* Randal Burns (Johns Hopkins Univ., USA)
* Christian Cachin (IBM Zurich, Switzerland)
* Valerie Henson (consultant, USA)
* Nikolai Joukov (IBM T.J. Watson Research Center, USA)
* Ethan Miller (UC Santa Cruz, USA)
* Dalit Naor (IBM Haifa, Israel)
* Alina Oprea (RSA Labs., USA)
* Jay Wylie (HP Labs, USA)

Posted In: sci.crypt.research

no comments

Reply

]]> Sun, 04 May 2008 03:54:02 PDT http://www.nnseek.com/e/sci.crypt.research/random_mapping_92382234t.html http://www.nnseek.com/e/sci.crypt.research/random_mapping_92382234t.html
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..

Posted In: sci.crypt.research

1 Comment

Reply

]]> Wed, 23 Jan 2008 08:06:42 PST http://www.nnseek.com/e/sci.crypt.research/_13th_european_symposium_on_research_in_computer_security_92366618t.html http://www.nnseek.com/e/sci.crypt.research/_13th_european_symposium_on_research_in_computer_security_92366618t.html
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

Assurance. Papers may present theory, technique, applications,
or practical experience on topics including:

- Access control
- Anonymity
- Authentication
- Authorization and delegation
- Cryptographic protocols
- Data integrity
- Dependability
- Information flow control
- Smartcards
- System security
- Digital right management
- Accountability
- Applied cryptography
- Covert channels
- Cybercrime
- Denial of service attacks
- Formal methods in security
- Inference control
- Information warfare
- Steganography
- Transaction management
- Data and application security
- Intellectual property protection
- Intrusion tolerance
- Peer-to-peer security
- Language-based security
- Network security
- Non-interference
- Privacy-enhancing technology
- Pseudonymity
- Subliminal channels
- Trustworthy user devices
- Identity management
- Security as quality of service
- Secure electronic commerce
- Security administration
- Security evaluation
- Security management
- Security models
- Security requirements engineering
- Security verification
- Survivability
- Information dissemination control
- Trust models and trust management policies

The primary focus is on high-quality original unpublished research,
case studies and

implementation experiences. We encourage submissions
of papers discussing industrial research and development. Proceedings
will be published by

Springer-Verlag in the Lecture Notes in Computer
Science series.


* Instructions for paper submission

Submitted papers must not substantially overlap 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 at most
20 pages total. Committee members are not required to read the
appendices, and so the

paper should be intelligible without them.
Authors must submit their paper using the conference web site
following the requirements

stated there.
Submissions must be received by March 31, 2008 in order to be
considered. Notification

will be sent to authors by June 16, 2008. Authors of
accepted papers must be prepared to sign a copyright statement and
must guarantee that

their paper will be presented at the conference. Authors
of accepted papers must follow the Springer Information for Authors'
guidelines for the

preparation of the manuscript and use the templates
provided there.


* Program Chairs

Sushil Jajodia, George Mason University, USA
Javier Lopez, University of Malaga, Spain


* Important dates

Paper Submission due: March 31, 2008
Acceptance notification: June 16, 2008
Final papers due: July 7, 2008

Posted In: sci.crypt.research

no comments

Reply

]]> Wed, 23 Jan 2008 04:37:37 PST http://www.nnseek.com/e/sci.crypt.research/cfp_50th_international_symposium_elmar_2008_zadar_90759194t.html http://www.nnseek.com/e/sci.crypt.research/cfp_50th_international_symposium_elmar_2008_zadar_90759194t.html
*****

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)

International Journal of Emerging Technologies in Learning (iJET)
International Journal of Interactive Mobile Technologies (iJIM)
Springer book - series "Studies in Computational Intelligence"


TOPICS

--> Image and Video Processing
--> Multimedia Communications
--> Speech and Audio Processing
--> Wireless Commununications
--> Telecommunications
--> Antennas and Propagation
--> e-Learning and m-Learning
--> Navigation Systems
--> Ship Electronic Systems
--> Power Electronics and Automation
--> Naval Architecture
--> Sea Ecology
--> Special Session Proposals - A special session consist
of 5-6 papers which should present a unifying theme
from a diversity of viewpoints; deadline for proposals
is February 04, 2008.


KEYNOTE TALKS

* Professor Sanjit K. Mitra, University of Southern
California, Los Angeles, California, USA:
Image Processing using Quadratic Volterra Filters

* Univ.Prof.Dr.techn. Markus Rupp, Vienna University
of Technology, AUSTRIA:
Testbeds and Rapid Prototyping in Wireless Systems

* Professor Paul Cross, University College London, UK:
GNSS Data Modeling: The Key to Increasing Safety and
Legally Critical Applications of GNSS

* Dr.-Ing. Malte Kob, RWTH Aachen University, GERMANY:
The Role of Resonators in the Generation of Voice
Signals


SPECIAL SESSIONS (proposals open until February 04, 2008)

SS1: "VISNET II - Networked Audiovisual Systems"
Organizer: Dr. Marta Mrak, I-lab, Centre for Communication
Systems Research, University of Surrey, UNITED KINGDOM
Contact: http://www.ee.surrey.ac.uk/CCSR/profiles?s_id=3937

SS2: "Computer Vision in Art"
Organizer: Asst.Prof. Peter Peer (1), Dr. Borut Batagelj (1)
and Prof. Karolj Skala (2) - (1) University of Ljubljana,
Faculty of Computer and Information Science, Computer Vision
Laboratory, SLOVENIA; (2) Rudjer Bokovic Institute, Center
for Informatics and Computing, Zagreb, CROATIA
Contact: http://www.lrv.fri.uni-lj.si/~peterp/

SS3: "Computer Vision in Art"
Organizer: Asst.Prof. Theodore Zahariadis, Prof. Stamatis
Voliotis and Nelly Leligoy, TEI of Chalkida, Psahna, GREECE
Contact: zahariad (_at_) teihal.gr


SUBMISSION

Papers accepted by two reviewers will be published in
symposium proceedings available at the symposium and
abstracted/indexed in the IEEE Xplore and INSPEC database.

More info is available here: http://www.elmar-zadar.org/

IMPORTANT: Web-based (online) paper submission of papers in
PDF format is required for all authors. No e-mail, fax, or
postal submissions will be accepted. Authors should prepare
their papers according to ELMAR-2008 paper sample, convert
them to PDF based on IEEE requirements, and submit them using
web-based submission system by March 03, 2008.


SCHEDULE OF IMPORTANT DATES

Deadline for submission of full papers: March 03, 2008
Notification of acceptance mailed out by: April 21, 2008
Submission of (final) camera-ready papers : May 05, 2008
Preliminary program available online by: May 12, 2008
Registration forms and payment deadline: May 19, 2008
Accommodation deadline: June 02, 2008


GENERAL CO-CHAIRS

Ive Mustac, Tankerska plovidba, Zadar, Croatia
Branka Zovko-Cihlar, University of Zagreb, Croatia


PROGRAM CHAIR

Mislav Grgic, University of Zagreb, Croatia


INTERNATIONAL PROGRAM COMMITTEE

Juraj Bartolic, Croatia
David Broughton, United Kingdom
Paul Dan Cristea, Romania
Kresimir Delac, Croatia
Zarko Cucej, Slovenia
Marek Domanski, Poland
Kalman Fazekas, Hungary
Janusz Filipiak, Poland
Renato Filjar, Croatia
Borko Furht, USA
Mohammed Ghanbari, United Kingdom
Mislav Grgic, Croatia
Sonja Grgic, Croatia
Yo-Sung Ho, Korea
Bernhard Hofmann-Wellenhof, Austria
Ismail Khalil Ibrahim, Austria
Bojan Ivancevic, Croatia
Ebroul Izquierdo, United Kingdom
Kristian Jambrosic, Croatia
Aggelos K. Katsaggelos, USA
Tomislav Kos, Croatia
Murat Kunt, Switzerland
Panos Liatsis, United Kingdom
Rastislav Lukac, Canada
Lidija Mandic, Croatia
Gabor Matay, Hungary
Branka Medved Rogina, Croatia
Borivoj Modlic, Croatia
Marta Mrak, United Kingdom
Fernando Pereira, Portugal
Pavol Podhradsky, Slovak Republic
Ramjee Prasad, Denmark
Kamisetty R. Rao, USA
Gregor Rozinaj, Slovak Republic
Gerald Schaefer, United Kingdom
Mubarak Shah, USA
Shiguang Shan, China
Thomas Sikora, Germany
Karolj Skala, Croatia
Marian S. Stachowicz, USA
Ryszard Stasinski, Poland
Luis Torres, Spain
Frantisek Vejrazka, Czech Republic
Stamatis Voliotis, Greece
Nick Ward, United Kingdom
Krzysztof Wajda, Poland
Branka Zovko-Cihlar, Croatia


CONTACT INFORMATION

Assoc.Prof. Mislav Grgic, Ph.D.
FER, Unska 3/XII
HR-10000 Zagreb
CROATIA

Telephone: + 385 1 6129 851
Fax: + 385 1 6129 568
E-mail: elmar2008 (_at_) fer.hr

For further information please visit:
http://www.elmar-zadar.org/

*****
*****

Posted In: sci.crypt.research

no comments

Reply

]]> Sat, 05 Jan 2008 08:06:25 PST http://www.nnseek.com/e/sci.crypt.research/semi_knowledge_proof_vs_zero_knowledge_proof_87134490t.html http://www.nnseek.com/e/sci.crypt.research/semi_knowledge_proof_vs_zero_knowledge_proof_87134490t.html
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 effiency of
some zero-knowlege proof system via this way! Thanks for your
attention.Please give some hints on this.

Posted In: sci.crypt.research

no comments

Reply

]]> Mon, 26 Nov 2007 05:19:58 PST http://www.nnseek.com/e/sci.crypt.research/call_for_participation_asiacrypt_2007_86387738t.html http://www.nnseek.com/e/sci.crypt.research/call_for_participation_asiacrypt_2007_86387738t.html
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

will be held in Kuching, Sarawak, Malaysia, organized by the IACR in
cooperation with the Swinburne University of Technology Sarawak campus
and the Sarawak Development

Institute, supported by the Sarawak state Government and Malaysian
Ministry of Tourism. Formal proceedings published by Springer will be
provided to registered attendees

at the conference. Technical sessions run from Monday morning to
Thursday noon, with a welcome reception on Sunday evening, a guided
excursion on Tuesday morning, and

official banquet on Wednesday evening. The customary Rump Session
will run as usual on Tuesday evening.

Venue Information:
Kuching is the capital of Sarawak, situated on Borneo Island. The
conference will be held at Crowne Plaza Hotel, Riverside Kuching
located at the Kuching Waterfront

overlooking the historical Fort Margherita across the Sarawak River,
right in the heart of the city's entertainment, dining, shopping and
business district; and 20 minutes

drive from the Kuching International Airport. Flight connections to
Kuching are available several times a day from Kuala Lumpur and
Singapore.

General Chair:
Raphael C.-W. Phan
EPFL - I&C - ISC - LASEC
CH-1015 Lausanne
SWITZERLAND
Tel: +41 21 693 8127
Email: asiacrypt2007@iacr.org

Program Chair:
Kaoru Kurosawa
Department of Computer & Information Sciences
Ibaraki University
4-12-1 Nakanarusawa, Hitachi, Ibaraki
316-8511, JAPAN
Tel/Fax: + 81 294 38 5135
Email: ac2007@mx.ibaraki.ac.jp

---

Program of Asiacrypt 2007:
--------------------------------------------------------------
December 3rd (Monday)
--------------------------------------------------------------
[1. Number Theory and Elliptic curve]
Session Chair: Serge Vaudenay
9:00-10:15

A kilobit special number field sieve factorization,
Kazumaro Aoki (NTT)
Jens Franke (University of Bonn, Department of Mathematics)
Thorsten Kleinjung (University of Bonn, Department of Mathematics)
Arjen K. Lenstra (EPFL and Bell Laboratories)
Dag Arne Osvik (EPFL)

When e-th Roots Become Easier Than Factoring,
Antoine Joux (DGA and Universit=E9 de Versailles)
David Naccache (Ecole normale sup=E9rieure)
Emmanuel Thom\'e (INRIA Lorraine, LORIA)

Faster addition and doubling on elliptic curves,
Daniel J. Bernstein (University of Illinois at Chicago, USA)
Tanja Lange (Technische Universiteit Eindhoven, Netherlands)

-------------------------------------------------------
[2. Protocol]
Session Chair: Xuejia Lai
10:40-11:30

A Non-Interactive Shuffle with Pairing Based Verifiability,
Jens Groth (University College London)
Steve Lu (UCLA, Math Department)

On Privacy Models for RFID,
Serge Vaudenay (EPFL)

--------------------------------------------------------
[Invited Talk I]
Session Chair: Masayuki Abe
11:30-12:30

Obtaining Universally Composable Security: Towards the Bare Bones of
Trust,
Ran Canetti (IBM T.J. Watson Research Center)

------------------------------------------------------------
[3. Hash Function Design]
Session Chair: Arjen Lenstra
14:00-15:15

A Simple Variant of the Merkle-Damg=E5rd Scheme with a Permutation,
Shoichi Hirose (University of Fukui, Japan),
Je Hong Park (ETRI Network & Communication Security Division,
Korea),
Aaram Yun (ETRI Network & Communication Security Division, Korea)

Seven-Property-Preserving Iterated Hashing: ROX,
Elena Andreeva (Katholieke Universiteit Leuven)
Gregory Neven (Katholieke Universiteit Leuven)
Thomas Shrimpton (Portland State University and University of
Lugano)
Bart Preneel (Katholieke Universiteit Leuven)

How to build a hash function from any collision-resistant function,
Thomas Ristenpart (University of California, San Diego)
Thomas Shrimpton (Portland State University and University of
Lugano)

-------------------------------------------------------------
[4. Group/Broadcast Cryptography]
Session Chair: Josef Pieprzyk
15:40-16:55

Fully Anonymous Group Signatures without Random Oracles,
Jens Groth (University College London)

Group Encryption,
Aggelos Kiayias (University of Connecticut, USA)
Yiannis Tsiounis (BestQuotes, USA)
Moti Yung (Columbia University, USA)

Identity-Based Broadcast Encryption with Constant Size Ciphertexts and
Private Keys,
C=E9cile Delerabl=E9e (Orange Labs)

----------------------------------------------------------------
December 4th (Tuesday)
---------------------------------------------------
[Guided Excursion to Semenggok Orang Utan Wildlife Centre and
Longhouse]
08:00 - 14:00

------------------------------------------------------------
[5. MAC and Implementation]
Session Chair: Thomas Johansson
14:00-15:15

Boosting Merkle-Damg=E5rd Hashing for Message Authentication,
Kan Yasuda (NTT, Japan)

On Efficient Message Authentication Via Block Cipher Design
Techniques,
G. Jakimoski and K. P. Subbalakshmi (Stevens Institute of
Technology)

Symmetric Key Cryptography on Modern Graphics Hardware,
James Goodman and Jason Yang (Advanced Micro Devices, Inc.)

-------------------------------------------------------------
[6. Multiparty Computation I]
Session Chair: Jung Hee Cheon
15:40-16:55

Blind Identity-Based Encryption and Simulatable Oblivious Transfer,
Matthew Green and Susan Hohenberger (The Johns Hopkins University)

Multi-Party Indirect Indexing and Applications,
Matthew Franklin, Mark Gondree and Payman Mohassel
(Dept. of Computer Science, University of California, Davis)

Two-Party Computing with Encrypted Data,
Seung Geol Choi (Computer Science Department, Columbia University)
Ariel Elbaz (Computer Science Department, Columbia University)
Ari Juels (RSA Laboratories)
Tal Malkin (Computer Science Department, Columbia University)
Moti Yung (Computer Science Department, Columbia University)

----------------------------------------------------
[Rump Session]
Session Chair: Aggelos Kiayias
19:00-

-------------------------------------------------------------
December 5th (Wednesday)
----------------------------------------------------
[7. Block Cipher]
Session Chair: Tetsu Iwata
9:00-10:15

Known-Key Distinguishers for Some Block Ciphers,
Lars R. Knudsen (Technical University of Denmark)
Vincent Rijmen (Graz University of Technology, Austria)

Generic Attacks on Unbalanced Feistel Schemes with Expanding
Functions,
Jacques Patarin (University of Versailles)
Valerie Nachef (University of Cergy-Pontoise)
Come Berbain (France Telecom Research and Developpement)

On Tweaking Luby-Rackoff Ciphers,
Elizabeth Crump Schwartz (College of William and Mary)
David Goldenberg (College of William and Mary)
Susan Hohenberger (Johns Hopkins University)
Moses Liskov (College of William and Mary)
Hakan Seyalioglu (College of William and Mary)

----------------------------------------------------
[8. Multiparty Computation II]
Session Chair: Pandu Rangan
10:40-12:20

Secure Protocols with Asymmetric Trust,
Ivan Damg=E5rd (Aarhus University)
Yvo Desmedt (University College London)
Matthias Fitzi (ETH Z=FCrich)
Jesper Buus Nielsen (Aarhus University)

Simple and Efficient Perfectly-Secure Asynchronous MPC,
Zuzana Beerliov=E1-Trub=EDniov=E1 (ETH Zurich)
Martin Hirt (ETH Zurich)

Efficient Byzantine Agreement with Faulty Minority,
Zuzana Beerliov=E1-Trub=EDniov=E1 (ETH Zurich)
Martin Hirt (ETH Zurich)
Micha Riser (ETH Zurich)

Information-theoretic security without an honest majority,
Anne Broadbent and Alain Tapp (Universit=E9 de Montr=E9al)

-------------------------------------------------------
[9. Foundation]
Session Chair: Jesper Buus Nielsen
14:00-15:15

Black-Box Extension Fields and the Inexistence of Field-Homomorphic
One-Way Permutations,
Ueli Maurer and Dominik Raub (ETH Zurich)

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way
Functions,
Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky and Amit Sahai (UCLA)

Anonymous Quantum Communication,
Gilles Brassard (Universit=E9 de Montr=E9al)
Anne Broadbent (Universit=E9 de Montr=E9al)
S=E9bastien Gambs (Universit=E9 de Montr=E9al)
Joseph Fitzsimons (University of Oxford)
Alain Tapp (Universit=E9 de Montr=E9al)

------------------------------------------------
[Invited Talk II]
Session Chair: Tsuyoshi Takagi
15:40-16:40

Authenticated Key Exchange and Key Encapsulation in the Standard
Model,
Tatsuaki Okamoto (NTT, Japan)

------------------------------------------------
[Official Banquet]
20:00-22:00

------------------------------------------------
December 6th (Thursday)
---------------------------------------------------
[10. Public Key Encryption]
Session Chair: Kaoru Kurosawa
9:00-10:15

Miniature CCA2 PK Encryption : Tight Security Without Redundancy,
Xavier Boyen (Voltage Inc.)

Bounded CCA2-Secure Encryption,
Ronald Cramer (CWI & Leiden University)
Goichiro Hanaoka (AIST, Japan)
Dennis Hofheinz (CWI)
Hideki Imai (AIST, Japan)
Eike Kiltz (CWI)
Rafael Pass (Cornell University)
abhi shelat (U. Virginia)
Vinod Vaikuntanathan (MIT)

Relations Among Notions of Non-Malleability for Encryption,
Rafael Pass (Cornell University)
abhi shelat (U. Virginia)
Vinod Vaikuntanathan (MIT)

------------------------------------------------------
[11. Cryptanalysis]
Session Chair: Bart Preneel
10:40-11:55

Cryptanalysis of the Tiger Hash Function,
Florian Mendel (Institute for Applied Information Processing and
Communications (IAIK))
Vincent Rijmen (Graz University of Technology, Austria)

Cryptanalysis of Grindahl, best paper award
Thomas Peyrin (France T=E9l=E9com R&D, AIST, University of Versailles)

A Key Recovery Attack on Edon80,
Martin Hell and Thomas Johansson (Lund University, Sweden)

-----------------------------------------------------

Posted In: sci.crypt.research

no comments

Reply

]]> Tue, 20 Nov 2007 09:52:20 PST http://www.nnseek.com/e/sci.crypt.research/reversible_hashing_84663578t.html http://www.nnseek.com/e/sci.crypt.research/reversible_hashing_84663578t.html
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.

Posted In: sci.crypt.research

6 Comments

Reply

]]> Sat, 03 Nov 2007 19:18:48 PDT http://www.nnseek.com/e/sci.crypt.research/new_practical_lattice_based_public_key_cryptosyste_81616666t.html http://www.nnseek.com/e/sci.crypt.research/new_practical_lattice_based_public_key_cryptosyste_81616666t.html
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.

The closest vector problem (i.e. given a random n-dimensional lattice A,
and a random n-dimensional point B, find a lattice point, that is closest
to B. A lattice is just a normal basis for a vector space, with the
addition requirement, that you are only allowed to multiply the basis
with integer-vectors (not real-vectors), to obtain a lattice point).

This closest-vector problem can be solved in practise up to dimensions
of 300. However, a basis for such a lattice contains 300*300 real values
(= 90000), hence it is a bit too large to be practical.

I came up with a new method, to get a hard instance (whether this is
really true, has to be analyzed) of this problem with a cyclic modular
lattice. I need only n values, to save a complete basis. Hence I can
use dimension up to 1000 efficiently.

The new algorithm is based upon a "almost linear homomorphic oneway
function", i.e. a function, which preserves the original group structure:
f(a, x) + f(b, x) = f(a+b, x) + e, where e is a small error for each
addition (hence, it's only almost linear). Furthermore we can exchange
a and x. (-> f(x, a) + f(x, b) = f(x, a+b) )

This function (and my first cryptanalytical research) is described
completely in the paper, which you can find on this website:
http://turbo-crypt.sourceforge.net/ You can download the paper directly,
from: http://turbo-crypt.sourceforge.net/TurboCrypt.pdf

Using this function, we can compute a public key in the following way:
PublicKey = {y1 = f(x1, g), y2 = f(x2, g), x1, x2}
The private key is g.

Now we can sign by computing:
1. Choose r at random
2. Compute R = {R1 = f(x1, r), R2 = f(x2, r)}
3. Compute {e1, e2} = Hash(R + Message)
4. Signature s = e1*g + e2*r
The Signature = {R, s}

The signature is verificated by:
1. Recompute {e1, e2} as has been done above
2. Compute U = {f(x1, s), f(x2, s)}
3. Compute V = {e1*y1 + e2*R1, e1*y2 + e2*R2}
4. Check, that U-V is small

There are some more details, which you can find in the paper.

The encryption function is similiar to the El Gamal encryption function.

You can find a complete description in the paper on the ciphers website:
http://turbo-crypt.sourceforge.net/

I would like, if you could send me any comment, critics or cryptanalysis
you can come up with, to my email address. Your contribution will be
honored: I will publish you critics with your name (unless, of course,
you do not want me to do so) on my website for the cryptosystem.

I look forward to hearing from you.

Sincerly,
Gerold Gruenauer

Jetzt neu! Sch=FCtzen Sie Ihren PC mit McAfee und WEB.DE. 3 Monate
kostenlos testen. http://www.pc-sicherheit.web.de/startseite/

Posted In: sci.crypt.research

no comments

Reply

]]> Mon, 08 Oct 2007 23:17:19 PDT