Download Advances in Cryptology - ASIACRYPT 2013: 19th International by Charanjit S. Jutla, Arnab Roy (auth.), Kazue Sako, Palash PDF

By Charanjit S. Jutla, Arnab Roy (auth.), Kazue Sako, Palash Sarkar (eds.)

The two-volume set LNCS 8269 and 8270 constitutes the refereed lawsuits of the nineteenth overseas convention at the conception and alertness of Cryptology and data, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers provided have been conscientiously chosen from 269 submissions. they're prepared in topical sections named: zero-knowledge, algebraic cryptography, theoretical cryptography, protocols, symmetric key cryptanalysis, symmetric key cryptology: schemes and research, side-channel cryptanalysis, message authentication codes, signatures, cryptography established upon actual assumptions, multi-party computation, cryptographic primitives, research, cryptanalysis and passwords, leakage-resilient cryptography, two-party computation, hash functions.

Show description

Read or Download Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part I PDF

Best international_1 books

Direct and Large-Eddy Simulation VII: Proceedings of the Seventh International ERCOFTAC Workshop on Direct and Large-Eddy Simulation, held at the University of Trieste, September 8-10, 2008

The 7th ERCOFTAC Workshop on "Direct and Large-Eddy Simulation" (DLES-7) used to be held on the college of Treste from September 8-10, 2008. Following the culture of earlier workshops within the DLES-series this version displays the state-of-the-art of numerical simulation of conventional and turbulent flows and supplied an lively discussion board for dialogue of modern advancements in simulation recommendations and realizing of circulate physics.

Lasers Based Manufacturing: 5th International and 26th All India Manufacturing Technology, Design and Research Conference, AIMTDR 2014

This ebook provides chosen study papers of the AIMTDR 2014 convention on software of laser expertise for varied production procedures equivalent to slicing, forming, welding, sintering, cladding and micro-machining. cutting-edge of those applied sciences when it comes to numerical modeling, experimental reports and commercial case experiences are offered.

Labyrinth and Piano Key Weirs III : Proceedings of the 3rd International Workshop on Labyrinth and Piano Key Weirs (PKW 2017), February 22-24, 2017, Qui Nhon, Vietnam

Because the first implementation through Electricité de France at the Goulours dam (France) in 2006, the Piano Key Weir has develop into a an increasing number of utilized strategy to raise the release means of latest spillways. In parallel, numerous new huge dam tasks were outfitted with one of these flood keep an eye on constitution, frequently together with gates.

Additional resources for Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part I

Sample text

The authority retains the following master secret key MSK: g2 , f (= gc2 ), and Δ1 , Δ2 , Δ3 , Δ4 , Δ5 , d, e, u, z. Encrypt(PK, i , M ). The encryption algorithm chooses s and tag at random from Zq . It then blinds M as C0 = M · ks , and also creates i ·s tag·s · vh·s , s C1 = gs1 , C2 = gb·s 1 , C3 = v1 · v2 · v3 4 where h = H(C0 , C1 , C2 , tag, i ). The ciphertext is then C = C0 , C1 , C2 , C3 , tag, p1 , p2 , where p1 , p2 is a QA-NIZK proof that C0 , C1 , C2 , C3 , i, tag, h ∈ L. KeyGen(MSK, i ).

Let us partition the Zq matrix 1×t A as At×t and the candidate vector l as l 0 At×s 0 1 1×s l1 . Note that, since A0 has rank t, the elements of l 0 are ‘free’ elements and l 0 can be extended to a unique n element vector l , which is a member of LA . This member vector l can be computed as l := l 0 −1 −l 0 · W , nothing W = −A0 A1 . The proof of l is computed as p := l 0 · D . Since both (l , p) and (l , p ) pass the verification equation, we obtain: l 1 − l 1 = b(p − p), where l 1 = −l 0 · W. In particular there exists i ∈ [1, s], such that, l 1i − l 1i = b(pi − pi ) = 01 .

At this point, one may immediately object that in the case of a single verifier identity, the problem is not interesting since the bounded player model is identical to the bare-public key model, where one can construct four-round cZK protocols using rewinding based techniques. However, simulation techniques involving rewinding do not “scale” well to the case of polynomially many identities (unless we use a large number of rounds) and fail. In contrast, our simulation approach is “straight-line” for an unbounded number of sessions and scales well to a large bounded number of identities.

Download PDF sample

Rated 4.93 of 5 – based on 41 votes