Progress in Cryptology - AFRICACRYPT 2010

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.

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.