By Phong Q. Nguyen, David Pointcheval

ISBN-10: 3642130127

ISBN-13: 9783642130120

This booklet constitutes the refereed lawsuits of the thirteenth foreign convention on perform and conception in Public Key Cryptography, PKC 2010, held in Paris, France, in may well 2010. The 29 revised complete papers awarded have been rigorously reviewed and chosen from a hundred forty five submissions. The papers are prepared in topical sections on encryption; cryptanalysis; protocols; community coding; instruments; elliptic curves; lossy trapdoor capabilities; discrete logarithm; and signatures.

Show description

Read Online or Download Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings ... Computer Science Security and Cryptology) PDF

Similar computers books

Download e-book for iPad: OS X El Capitan in Easy Steps by Nick Vandome

OS X is the working approach on the middle of Mac pcs. the most recent model, OS X El Capitan, builds on a few of cutting edge features and point of functionality that have been brought with the former model, OS X Yosemite, to supply a trendy, powerful and robust working approach in your Mac computing device.

Read e-book online Formal Hardware Verification: Methods and Systems in PDF

This cutting-edge monograph provides a coherent survey of quite a few tools and platforms for formal verification. It emphasizes the presentation of ways that experience matured into instruments and platforms usable for the particular verification of nontrivial circuits. All in all, the ebook is a consultant and well-structured survey at the good fortune and destiny power of formal equipment in proving the correctness of circuits.

Extra resources for Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings ... Computer Science Security and Cryptology)

Example text

A concept which is more generic than attribute-based encryption is that of predicate encryption [KSW08]: the decryption policy, chosen by the sender of the message, is hidden in the ciphertext, in such a way that even the receiver gets no information on this policy, other than the fact that his attributes satisfy it or not. Because of this additional strong privacy requirement, current proposals for predicate encryption consider quite simple (not very expressive) policies. We stress that all the existing proposals for ABE schemes produce ciphertexts whose size depends (at least) linearly on the number of attributes involved in the policy for that ciphertext.

C. -J. Spaenlehauer Algorithm 1. Level 1 Attack 1: Compute a Gr¨ obner basis of the ideal F0 − F1 , X ∩ Fp [y, t]. Generically this Gr¨ obner basis contains only one polynomial Q(y, t). 2: Factor Q = Qi (y, t). Let Q0 (y, t) ∈ Fp [y, t] denote an irreducible factor with highest degree with respect to y. 3: Compute a Gr¨ obner basis of the ideal J = F0 , F1 , X, Q0 . 4: To retrieve the plaintext (up to multiplication by a scalar in Fp ), solve the linear system over Fp (m) dij mijk N FJ (xi y j tk ) = 0.

Security Model for ABE Schemes. Most previous schemes (all but the one in [LO+10]) consider only security under selective chosen plaintext attacks. This is also the security level that will be provably achieved by our scheme. Indistinguishability under selective chosen plaintext attacks (IND-sCPA security, for short) for an attribute-based encryption scheme ABE supporting threshold decryption policies and for a security parameter λ ∈ N is defined by considering the following game that an attacker A plays against a challenger: 24 J.

Download PDF sample

Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings ... Computer Science Security and Cryptology) by Phong Q. Nguyen, David Pointcheval


by George
4.3

Rated 4.46 of 5 – based on 25 votes