05:36 [Pub]
New Reviews
The following reviews shall help the IACR members and the
community to buy books in cryptology and related areas.
The full list of reviews / books is available at
www.iacr.org/books
If you have any questions regarding the IACR book reviewing
system, or would like to volunteer a review, please contact
Edoardo Persichetti (University of Warsaw, Poland) via /books
at iacr.org/.
New reviews in 2014:

R. Lidl, H. Niederreiter: Finite Fields (2nd Edition)
"This volume gives a comprehensive coverage of the theory
of finite fields and its most important applications such
as combinatorics and coding theory. Its simple and
readerfriendly style, and the inclusion of many worked
examples and exercises make it suitable not only as a
reference volume for the topic, but also as a textbook
for a dedicated course. I highly recommend the book to
any person interested in the theory of finite fields and
its applications."
Year: 2008
ISBN: 9780521065672
Review by Edoardo Persichetti (Warsaw University,
Warsaw, Poland). (Date: 20140130)

A. McAndrew: Introduction to Cryptography with
OpenSource Software
"This very well written book is recommended to graduate
or final year undergraduate students intended to start
research work on both theoretical and experimental
cryptography. Most of the cryptographic protocols are
illustrated by various examples and implemented using the
opensource algebra software Sage. The book provides a
rigorous introduction to the mathematics used in
cryptographic and covers almost all modern practical
cryptosystems. Also, the book is certainly a valuable
resource for practitioners looking for experimental
cryptography with a computer algebra system."
Year: 2011
ISBN: 9781439825709
Review by Abderrahmane Nitaj (LMNO, UniversitÃ© de
Caen Basse Normandie, France). (Date: 20140213)

B. Martin: Codage, Cryptologie et Applications [French]
"This French book succinctly describes the mathematical
principles of cryptography and error correcting codes.
Once these principles are introduced, the book presents
their use in some telecommunication applications (at the
state of the art in 2004). The book does not define its
target audience. It is probably not enough detailed for a
skilled audience, nor particularly suitable for beginners
and students, since it requires mathematical background
that they would have to find elsewhere."
Year: 2006
ISBN: 2880745691
Review by Eric Diehl (Technicolor, Paris, France).
(Date: 20140212)

T. BaignÃ¨res, P. Junod, Y. Lu, J. Monnerat, S. Vaudenay:
A Classical Introduction To Cryptography Exercise Book
"The book's main goal is to show how some mathematical
notions of calculus, algebra, and computer science are
used to study the security of various cryptosystems. The
volume is a collection of exercises, including hints and
solutions, and is suitable for advanced undergraduate and
graduate students as well as students in computer science
and engineering and practitioners who want to understand
the mathematical techniques behind cryptography."
Year: 2006
ISBN: 9780387279343
Review by Abdelhak Azhari (Hassan II University,
Casablanca, Morocco). (Date: 20140212)

J. Buchmann, U. Vollmer: Binary Quadratic Forms
"The theory of binary quadratic forms is important in
algebraic number theory. This book offers a good
introduction to binary quadratic forms by following an
algorithmic approach. It will be useful for students and
teachers interested in binary quadratic forms and their
cryptographic applications."
Year: 2007
ISBN: 9783540463672
Review by S.V. Nagaraj (RMK Engineering College,
Kavaraipettai, Tamil Nadu, India). (Date: 20140519)

J. Hoffstein, J. Pipher, J. Silverman: An Introduction to
Mathematical Cryptography
"This volume provides an excellent introduction to the
mathematics of cryptography. Its simple style make it
accessible even to readers without a consistent
mathematical background. I highly recommend this book to
anyone, in particular nonspecialists that are interested
in the topic, and students that want to approach
cryptography from a mathematical point of view. It is
also very useful for instructors in the same context  I
personally found it an an invaluable tool for preparing
my graduate cryptography course."
Year: 2008
ISBN: 9780387779935
Review by Edoardo Persichetti (University of Warsaw,
Poland). (Date: 20140327)
14:08 [Job][New]
Research Associate (PostDoc), University College London, the Greater Britain, Europe
The Computer Science Department at University College London have two openings for postdoctoral researchers in cryptography. The posts are under the supervision of Dr Jens Groth with a duration of up to 2 years and a flexible starting date. Candidates must have a PhD with a strong publication record in cryptography or theoretical computer science.UCL is one of Europe\\\'s highest ranked universities, has a large and active Information Security group and has recently been recognized by the EPSRC and GCHQ as one of UK\\\'s Academic Centres of Excellence in Cyber Security Research. The Computer Science Department is one of the largest in the UK and is located at UCL\\\'s main campus in the centre of London.
09:17 [Pub][ePrint]
Composable Oblivious Extended Permutations, by Peeter Laud and Jan Willemson
An extended permutation is a function f : {1,...,m} > {1,...,n}, used to map an nelement vector a to an melement vector b by b_i = a_{f(i)}. An oblivious extended permutation allows this mapping to be done while preserving the privacy of a, b and f in a secure multiparty computation protocol. Oblivious extended permutations haveseveral uses, with private function evaluation (PFE) being the theoretically most prominent one.
In this paper, we propose a new technique for oblivious evaluation of
extended permutations. Our construction is at least as efficient as the existing techniques, conceptually simpler, and has wider applicability. Our technique allows the party providing the description of f to be absent during the computation phase of the protocol. Moreover, that party does not even have to exist  we show how to compute the private representation of f from private data that may itself be computed from the inputs of parties. In other words, our oblivious extended permutations can be freely composed with other privacypreserving operations in a multiparty computation.
09:17 [Pub][ePrint]
Software implementation of an AttributeBased Encryption scheme, by Eric Zavattoni and Luis J. Dominguez Perez and Shigeo Mitsunari and Ana H. SÃ¡nchezRamÃrez and Tadanori Teruya and Francisco RodrÃ
A ciphertextpolicy attributebased encryption protocol uses bilinear pairings to providecontrol access mechanisms, where the set of user\'s attributes is specified by means of a linear secret sharing scheme. In this paper we present the design of a software cryptographic library that achieves record timings for the computation of a 126bit security level attributebased encryption scheme. We developed all the required auxiliary building blocks and compared the computational weight that each of them adds to the overall performance of this protocol.
In particular, our single pairing and multipairing implementations achieve stateoftheart
time performance at the 126bit security level.
09:17 [Pub][ePrint]
On the Existence of Extractable OneWay Functions, by Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen
A function f is extractable if it is possible to algorithmically ``extract,\'\' from any adversarial program that outputs a value y in the image of f, a preimage of y.When combined with hardness properties such as onewayness or collisionresistance, extractability has proven to be a powerful tool. However, so far, extractability has not been explicitly shown. Instead, it has only been considered as a nonstandard *knowledge assumption* on certain functions.
We make two headways in the study of the existence of extractable oneway functions (EOWFs). On the negative side, we show that if there exist indistinguishability obfuscators for a certain class of circuits then
there do not exist EOWFs where extraction works for any adversarial program with auxiliaryinput of unbounded polynomial length.
On the positive side, for adversarial programs with bounded auxiliaryinput (and unbounded polynomial running time), we give the first construction of EOWFs with an explicit extraction procedure, based on relatively standard assumptions (e.g., subexponential hardness of Learning with Errors). We then use these functions to construct the first 2message zeroknowledge arguments and 3message zeroknowledge arguments of knowledge, against the same class of adversarial verifiers, from essentially the same assumptions.