Advances in Cryptology – ASIACRYPT 2012: 18th International by Dan Boneh (auth.), Xiaoyun Wang, Kazue Sako (eds.)

By Dan Boneh (auth.), Xiaoyun Wang, Kazue Sako (eds.)

This ebook constitutes the refereed lawsuits of the 18th foreign convention at the concept and alertness of Cryptology and knowledge safety, Asiacrypt 2012, held in Beijing, China, in December 2012. The forty three complete papers provided have been rigorously reviewed and chosen from 241 submissions. they're equipped in topical sections named: public-key cryptography, beginning, symmetric cipher, safety evidence, lattice-based cryptography and quantity idea, hash functionality, cryptographic protocol, and implementation issues.

Show description

Read Online or Download Advances in Cryptology – ASIACRYPT 2012: 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings PDF

Best international books

Multi-Carrier Spread-Spectrum: Proceedings from the 5th International Workshop, Oberpfaffenhofen, Germany, September 14-16, 2005

The advantages and good fortune of multi-carrier (MC) modulation on one facet and the pliability provided through the unfold spectrum (SS) method at the different aspect have inspired many researchers to enquire the mix of either concepts because 1993. this mixture often called multi-carrier unfold spectrum (MC-SS) advantages from the benefits of either structures and provides excessive flexibility, excessive spectral potency, basic detection options, narrow-band interference rejection potential, and so on.

Intelligent Informatics: Proceedings of the International Symposium on Intelligent Informatics ISI’12 Held at August 4-5 2012, Chennai, India

This ebook constitutes the completely refereed post-conference lawsuits of the 1st foreign Symposium on clever Informatics (ISI'12) held in Chennai, India in the course of August 4-5, 2012. The fifty four revised papers offered have been conscientiously reviewed and chosen from a hundred sixty five preliminary submissions. The papers are geared up in topical sections on information mining, clustering and clever info structures, multi agent structures, development acceptance, sign and snapshot processing and, laptop networks and disbursed platforms.

Extra info for Advances in Cryptology – ASIACRYPT 2012: 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings

Example text

We count the number of group elements excluding a default generator for each group in gk, and distinguish between G1 and G2 and use k1 and k2 for the number of message elements in G1 and G2 , respectively. For comparison, we include the efficiency of the schemes in [4] and [2]. For bilateral messages, AHO10 is combined with POSb from Section 6. 22 M. Abe et al. Applications. Structure-preserving signatures (SPS) have become a mainstay in cryptographic protocol design in recent years. From the many applications that benefit from efficient SPS based on simple assumptions, we list only a few recent examples.

The global parameter gk is given to all functions implicitly. – Setup(1λ ): Run Λ = (p, G1 , G2 , GT , e) ← G(1λ ) and choose generators G ∈ G∗1 ˆ ∈ G∗ . Also choose u, f2 , f3 randomly from Z∗ , compute F2 := Gf2 , and G 2 p ˆ f2 , Fˆ3 := G ˆ f3 , U := Gu , U ˆ := G ˆ u , and output gk := F3 := Gf3 , Fˆ2 := G ˆ ˆ ˆ ˆ (Λ, G, G, F2 , F3 , F2 , F3 , U, U ). ˆ m ) ∈ G∗2 | m ∈ Zp } for the A gk defines a message space Mx = {(Fˆ2m , Fˆ3m , U signature scheme in this section. For our generic construction to work, the partial onetime signature scheme should have the same key space.

ASIACRYPT 2012, LNCS 7658, pp. 25–42, 2012. c International Association for Cryptologic Research 2012 26 M. Gerbush et al. protocols. , [17,13,24,48]) that are both practical and have added structure which has been used to build other primitives ranging from Aggregate Signatures [15,43] to Oblivious Transfer [25,32]. Ideally, for such a fundamental cryptographic primitive we would like to have security proofs from straightforward, static complexity assumptions. Meeting this goal for certain systems is often challenging.

Download PDF sample

Rated 4.80 of 5 – based on 49 votes