Atjaunināt sīkdatņu piekrišanu

E-grāmata: Pairing-Based Cryptography - Pairing 2008: Second International Conference, Egham, UK, September 1-3, 2008, Proceedings

Edited by , Edited by
  • Formāts: PDF+DRM
  • Sērija : Security and Cryptology 5209
  • Izdošanas datums: 25-Aug-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783540855385
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
  • Formāts: PDF+DRM
  • Sērija : Security and Cryptology 5209
  • Izdošanas datums: 25-Aug-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783540855385

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the thoroughly refereed proceedings of the Second International Conference on Pairing-Based Cryptography, Pairing 2008, held in London, UK, in September 2008.
The 20 full papers, presented together with the contributions resulting from 3 invited talks, were carefully reviewed and selected from 50 submissions. The contents are organized in topical sections on cryptography, mathematics, constructing pairing-friendly curves, implementation of pairings, and hardware implementation.

The Pairing 2008 Conference was held at Royal Holloway, University of London during September 1–3, 2008. This conference followed on from the Pairing in Cryptography workshop (held in Dublin, Ireland on June 12–15, 2005) and the Pairing 2007 conference (held in Tokyo, Japan on July 2–4, 2007, with proce- ings published in Springer’s LNCS 4575). The aim of this series of conferences is to bring together leading researchers and practitioners from academia and industry, all concerned with problems related to pairing-based cryptography. The programme consisted of 3 invited talks and 20 contributed papers. The invitedspeakerswereXavierBoyen(VoltageSecurity,USA),FlorianHess(Te- nical University Berlin, Germany) and Nigel Smart (University of Bristol, UK). Special thanks are due to these speakers, all three of whom provided papers which are included in these proceedings. The contributed talks were selected from ?fty submissions. The accepted papers cover a range of topics in mathematics and computer science, including hardwareand softwareimplementation of pairings,cryptographicprotocols,and mathematical aspects and applications of pairings. We would like to thank all the people who helped with the conference p- gramme and organisation. First, we thank the Steering Committee for their guidance and suggestions. We also heartily thank the Programme Committee and the sub-reviewers listed on the following pages for their thoroughness d- ing the review process. Each paper was reviewed by at least three people and there was signi cant online discussion about a number of papers.
Invited Talks.- Pairings in Trusted Computing.- Pairing Lattices.- The
Uber-Assumption Family.- Cryptography I.- Homomorphic Encryption and
Signatures from Vector Decomposition.- Hidden-Vector Encryption with Groups
of Prime Order.- Mathematics.- The Hidden Root Problem.- Evaluating Large
Degree Isogenies and Applications to Pairing Based Cryptography.- Computing
the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.-
Constructing Pairing Friendly Curves.- Constructing Brezing-Weng
Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field.-
Constructing Pairing-Friendly Elliptic Curves Using Factorization of
Cyclotomic Polynomials.- A Generalized Brezing-Weng Algorithm for
Constructing Pairing-Friendly Ordinary Abelian Varieties.- Pairing-Friendly
Hyperelliptic Curves with Ordinary Jacobians of Type y 2?=?x 5?+?ax.-
Implementation of Pairings.- Integer Variable ?Based Ate Pairing.- Pairing
Computation on Twisted Edwards Form Elliptic Curves.- Exponentiation in
Pairing-Friendly Groups Using Homomorphisms.- Generators for the ?-Torsion
Subgroup of Jacobians of Genus Two Curves.- Speeding Up Pairing Computations
on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms.-
Pairings on Hyperelliptic Curves with a Real Model.- Hardware
Implementation.- Faster Implementation of ? T Pairing over GF(3 m ) Using
Minimum Number of Logical Instructions for GF(3)-Addition.- A Comparison
between Hardware Accelerators for the Modified Tate Pairing over and
.- Cryptography II.- One-Round ID-Based Blind Signature Scheme without ROS
Assumption.- Tracing Malicious Proxies in Proxy Re-encryption.- Security and
Anonymity of Identity-Based Encryption with Multiple Trusted Authorities.