Get Advances in Cryptology - ASIACRYPT 2008: 14th International PDF

By Martin Hirt, Ueli Maurer, Vassilis Zikas (auth.), Josef Pieprzyk (eds.)

ISBN-10: 3540892540

ISBN-13: 9783540892540

This ebook constitutes the refereed lawsuits of the 14th foreign convention at the concept and alertness of Cryptology and knowledge protection, ASIACRYPT 2008, held in Melbourne, Australia, in December 2008.

The 33 revised complete papers awarded including the summary of one invited lecture have been conscientiously reviewed and chosen from 208 submissions. The papers are prepared in topical sections on muliti-party computation, cryptographic protocols, cryptographic hash services, public-key cryptograhy, lattice-based cryptography, private-key cryptograhy, and research of movement ciphers.

Show description

Read or Download Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings PDF

Similar cryptography books

Read e-book online An Introduction to Mathematical Cryptography (2nd Edition) PDF

This self-contained advent to trendy cryptography emphasizes the math in the back of the speculation of public key cryptosystems and electronic signature schemes. The e-book makes a speciality of those key subject matters whereas constructing the mathematical instruments wanted for the development and defense research of numerous cryptosystems.

Quantum Attacks on Public-Key Cryptosystems by Song Y. Yan PDF

На английском: The cryptosystems according to the Integer Factorization challenge (IFP), the Discrete Logarithm challenge (DLP) and the Elliptic Curve Discrete Logarithm challenge (ECDLP) are basically the single 3 different types of functional public-key cryptosystems in use. the protection of those cryptosystems is based seriously on those 3 infeasible difficulties, as no polynomial-time algorithms exist for them up to now.

Download PDF by Christian Krieg, Adrian Dabrowski, Heidelinde Hobel,: Hardware Malware

In our electronic global, built-in circuits are found in approximately each second of our everyday life. even if utilizing the espresso laptop within the morning, or riding our vehicle to paintings, we have interaction with built-in circuits. The expanding unfold of data expertise in almost all components of existence within the industrialized global bargains a extensive diversity of assault vectors.

Extra resources for Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings

Sample text

The conditions for 34 Z. Zhang et al. 3-multiplicativity are easy to verify, while verification for strong multiplicativity involves checking an exponential number of equations (each subset in the adversary structure corresponds to an equation). With 3-multiplicative LSSS, or more generally λ-multiplicative LSSS, we can simplify local computation for each player and reduce the round complexity in MPC protocols. For example, using the technique of Bar-Ilan and Beaver [1], l we can compute i=1 xi , xi ∈ Fq , in a constant number of rounds, independent of l.

Using an identical argument for the case of strongly multiplicative LSSS, we have a general construction for 3-multiplicative LSSS based on Shamir’s threshold secret sharing schemes, with exponential complexity. For any λ vectors xi = (xi1 , . . , xid ) ∈ Kd , 1 ≤ i ≤ λ, we define λi=1 xi to n λ be the i=1 dλi -dimensional vector which contains entries of the form i=1 xiji with ψ(j1 ) = · · · = ψ(jλ ). Definition 3 (λ-Multiplicativity). Let M(K, M, ψ, e1 ) be an LSSS realizing the access structure AS, and let λ > 1 be an integer.

Suppose M(K, M, ψ, e1 ) is a 3-multiplicative LSSS realizing AS, and suppose to the contrary, that AS is not Q3 , so there exist A1 , A2 , A3 ∈ A = 2P − AS such that A1 ∪ A2 ∪ A3 = P . By Proposition 1, there exists ρi ∈ Kl−1 such that MAi (1, ρi )τ = 0τ for 1 ≤ i ≤ 3. Since A1 ∪ A2 ∪ A3 = P , we have M (1, ρ1 )τ M (1, ρ2 )τ M (1, ρ3 )τ = 0τ , which contradicts Definition 2. On the other hand, a general construction for building a 3-multiplicative LSSS from a strongly multiplicative LSSS is given in the next section, thus sufficiency is guaranteed by Proposition 2.

Download PDF sample

Advances in Cryptology - ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings by Martin Hirt, Ueli Maurer, Vassilis Zikas (auth.), Josef Pieprzyk (eds.)


by David
4.1

Rated 4.33 of 5 – based on 4 votes