Posted in International 1

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 thought and alertness of Cryptology and knowledge, 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 Online 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

Implementation of Functional Languages: 10th International Workshop, IFL’98 London, UK, September 9–11, 1998 Selected Papers

This ebook constitutes the completely refereed post-workshop court cases of the tenth overseas Workshop at the Implementation of sensible Languages, IFL'98, held in London, united kingdom, in September 1998. The 15 revised complete papers provided have been conscientiously chosen in the course of rounds of reviewing. the quantity covers quite a lot of subject matters together with parallel approach association, parallel profiling, compilation and semantics of parallel structures, programming method, interrupt dealing with, strictness research, concurrency and message passing, and inter-language operating.

Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings

This booklet constitutes the refereed complaints of the twenty seventh foreign convention on Algorithmic studying idea, ALT 2016, held in Bari, Italy, in October 2016, co-located with the nineteenth overseas convention on Discovery technology, DS 2016. The 24 standard papers offered during this quantity have been rigorously reviewed and chosen from forty five submissions.

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

Fig. 2. Rsim - A variant of Barak’s relation [28] a “good” error-correcting code ECC (with constant distance and polynomialtime encoding and decoding procedures), and replacing the condition c = Com(h(Π); s) with c = Com(ECC(h(Π)); s). Our protocol. We are now ready to present our concurrent zero knowledge protocol, denoted P, V . Let P and V denote the prover and verifier respectively. Let N denote the bound on the number of verifiers in the system. In our construction, the identity of a verifier Vi corresponds to a verification key vki of a secure signature scheme and a hash function hi ∈ Hn from a family Hn of collision-resistant hash functions.

The authority uses a group generation algorithm for which the SXDH assumption holds to generate a bilinear group (G1 , G2 , GT ) with g2 and g1 as generators of G1 and G2 respectively. Assume that G1 and G2 are of order q, and let e be a bilinear pairing on G1 × G2 . Then it picks c at random from Zq , and sets f = gc2 . It further picks Δ1 , Δ2 , Δ3 , Δ4 , Δ5 , b, d, e, u, z from Zq , and publishes the following public key PK: 1 ·b+d 2 ·b+e 3 ·b+c 4 ·b+z g1 , gb1 , v1 = g−Δ , v2 = g−Δ , v3 = g−Δ , v4 = g−Δ , and k = 1 1 1 1 −Δ5 ·b+u .

Hierarchical predicate encryption for inner-products. In: Matsui, M. ) ASIACRYPT 2009. LNCS, vol. 5912, pp. 214–231. Springer, Heidelberg (2009) 21. : Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. ) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992) Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces 19 22. : Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. In: 40th FOCS Annual Symposium on Foundations of Computer Science, pp.

Download PDF sample

Rated 4.15 of 5 – based on 46 votes