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.)

ISBN-10: 364242032X

ISBN-13: 9783642420320

ISBN-10: 3642420338

ISBN-13: 9783642420337

The two-volume set LNCS 8269 and 8270 constitutes the refereed court cases of the nineteenth foreign convention at the concept and alertness of Cryptology and knowledge, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers provided have been rigorously chosen from 269 submissions. they're geared up 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

Advances in Cryptology - ASIACRYPT 2013: 19th International - download pdf or read online

The two-volume set LNCS 8269 and 8270 constitutes the refereed court cases of the nineteenth overseas convention at the concept and alertness of Cryptology and data, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers offered have been rigorously chosen from 269 submissions.

Read e-book online Adaptive and Intelligent Systems: Third International PDF

This publication constitutes the complaints of the overseas convention on Adaptive and clever structures, ICAIS 2014, held in Bournemouth, united kingdom, in September 2014. the nineteen complete papers incorporated in those lawsuits including the abstracts of four invited talks, have been conscientiously reviewed and chosen from 32 submissions.

Download e-book for kindle: Humanitarian Intervention and the AU-ECOWAS Intervention by John-Mark Iyi

The booklet reconciles the conflicts and felony ambiguities among African Union and ECOWAS legislations at the use of strength at the one hand, and the UN constitution and foreign legislations nonetheless. In view of questions in relation to African Union and UN dating within the upkeep of overseas peace and protection in Africa in recent times, the e-book examines the criminal concerns concerned and the way they are often resolved.

Extra info 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

Goyal et al. Statistically binding commitment schemes. In our constructions, we will make use of a statistically binding string commitment scheme, denoted Com. For simplicity of exposition, we will make the simplifying assumption that Com is a non-interactive perfectly binding commitment scheme. g. [24]. Unless stated otherwise, we will simply use the notation Com(x) to denote a commitment to a string x, and assume that the randomness (used to create the commitment) is implicit. We will denote by Com(x; r) a commitment to a string x with randomness r.

We will denote such an argument system by PWI , VWI . The universal argument of [2]. In our construction, we will use the 4-round universal argument system (UA), denoted pUA presented in [2] and based on the existence of collision-resistant hash functions. We will assume without loss of generality that the initial commitment of the PCP sent by the prover in the second round also contains a commitment of the statement. We notice that such an argument system is still sound when the prover is required to open the commitment of the statement in the very last round.

Note that CRSv is independent of the parameter. Prover P. Given candidate l = x · A with witness vector x, the prover generates the following proof consisting of s elements in G1 : p := x · CRSp Verifier V. Given candidate l , and a proof p, the verifier checks the following: e l ? 1×s p , CRSv = 0T The security of the above system depends on the DDH assumption in group G2 . Since G2 is a bilinear group, this assumption is known as the XDH assumption. These assumptions are standard and are formally described in [15].

Download PDF sample

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 by Charanjit S. Jutla, Arnab Roy (auth.), Kazue Sako, Palash Sarkar (eds.)


by William
4.3

Rated 4.29 of 5 – based on 47 votes