Progress in Cryptology--AFRICACRYPT 2010

ISBN-13: 9783642126772 / Angielski / Miękka / 2010 / 436 str.

Daniel J. Bernstein; Tanja Lange

Opis

Africacrypt 2010, the Third International Conference on Cryptology in Africa, took place May 3-6, 2010 in Stellenbosch, South Africa. The General Chairs, Riaal Domingues from the South African Communications and Security Agency and Christine Swart from the University of Cape Town, were always a pleasure to work with and did an outstanding job with the local arrangements. We are deeplythankfulthat theyagreedto hostAfricacrypt2010with onlyfour months notice after unanticipated events forced a change of location. The Africacrypt 2010 submission deadline was split into two. Authors s- mitting paperswererequiredto registertitles andabstractsby the rstdeadline, January 5. A total of 121 submissions had been received by this deadline, - though some were withdrawn before review. Authors were allowed to continue working on their papers until the second deadline, January 10. Submissions were evaluated in three phases over a period of nearly two months. The selection phase started on January 5: Program Committee m- bers began evaluating abstracts and volunteering to handle various papers. We assigned a team of people to each paper. The review phase started on January 11: Program Committee members were given access to the full papers and - gan in-depth reviews of 82 submissions. Most of the reviews were completed by February7, thebeginningofthediscussionphase.ProgramCommitteemembers were given access to other reviews and built consensus in their evaluations of the submissions. In the end the discussions included 285 full reports and 203 - ditional comments. The submissions, reviews, and subsequent discussions were handled smoothly by iChair.

Spis treści

Signatures.- A New RSA-Based Signature Scheme.- Fair Blind Signatures without Random Oracles.- Fair Partially Blind Signatures.- Attacks.- Parallel Shortest Lattice Vector Enumeration on Graphics Cards.- Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over .- Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits.- Protocols.- Proofs of Restricted Shuffles.- Batch Range Proof for Practical Small Ranges.- Optimistic Fair Priced Oblivious Transfer.- Networks.- Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes.- Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes.- Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.- Elliptic Curves.- Avoiding Full Extension Field Arithmetic in Pairing Computations.- ECC2K-130 on Cell CPUs.- Side-Channel Attacks and Fault Attacks.- Practical Improvements of Profiled Side-Channel Attacks on a Hardware Crypto-Accelerator.- Differential Fault Analysis of HC-128.- Fresh Re-keying: Security against Side-Channel and Fault Attacks for Low-Cost Devices.- Public-Key Encryption.- Strong Cryptography from Weak Secrets.- Efficient Unidirectional Proxy Re-Encryption.- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions.- Keys and PUFs.- Flexible Group Key Exchange with On-demand Computation of Subgroup Keys.- Quantum Readout of Physical Unclonable Functions.- Ciphers and Hash Functions.- Parallelizing the Camellia and SMS4 Block Ciphers.- Improved Linear Differential Attacks on CubeHash.- Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512.

O autorze

Daniel J. Bernstein is a research professor in the Department of Computer Science at the University of Illinois at Chicago. Professor Bernstein has received a U.S. NationalScience Foundation CAREER award, a Cyber Trust award, three more U.S.government grants, and a Sloan Research Fellowship for his research in computational number theory, cryptography, and computer security. He is the author of several dozen papers and two of the Internet's most popular server software packages, djbdns and qmail.