LEADER 04400nam 2200661 450 001 996465339603316 005 20211007175711.0 010 $a3-540-85538-6 024 7 $a10.1007/978-3-540-85538-5 035 $a(CKB)1000000000490855 035 $a(SSID)ssj0000319321 035 $a(PQKBManifestationID)11265733 035 $a(PQKBTitleCode)TC0000319321 035 $a(PQKBWorkID)10337092 035 $a(PQKB)11399216 035 $a(DE-He213)978-3-540-85538-5 035 $a(MiAaPQ)EBC3063536 035 $a(MiAaPQ)EBC6511627 035 $a(Au-PeEL)EBL6511627 035 $a(OCoLC)1166255366 035 $a(PPN)128126256 035 $a(EXLCZ)991000000000490855 100 $a20211007d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aPairing-based cryptography - Pairing 2008 $esecond international conference, Egham, UK, September 1-3, 2008 ; proceedings /$fSteven D. Galbraith, Kenneth G. Paterson (eds.) 205 $a1st ed. 2008. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[2008] 210 4$d©2008 215 $a1 online resource (XI, 377 p.) 225 1 $aSecurity and Cryptology ;$v5209 300 $aIncludes index. 311 $a3-540-85503-3 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 330 $aThis 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. 410 0$aSecurity and Cryptology ;$v5209 606 $aComputer security$vCongresses 606 $aSets of pairs of functions to be distinguished$vCongresses 606 $aCryptography$vCongresses 615 0$aComputer security 615 0$aSets of pairs of functions to be distinguished 615 0$aCryptography 676 $a005.82 686 $a54.62$2bcl 702 $aPaterson$b Kenneth G.$f1969- 702 $aGalbraith$b Steven D. 712 12$aInternational Conference on Pairing-Based Cryptography 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465339603316 996 $aPairing-Based Cryptography – Pairing 2008$9774467 997 $aUNISA