LEADER 02417nam 2200445Ia 450 001 9910790509903321 005 20230803022026.0 010 $a0-7022-5183-6 035 $a(CKB)2550000001132149 035 $a(EBL)1340890 035 $a(OCoLC)855969790 035 $a(MiAaPQ)EBC1340890 035 $a(Au-PeEL)EBL1340890 035 $a(CaPaEBR)ebr10745683 035 $a(CaONFJC)MIL531858 035 $a(EXLCZ)992550000001132149 100 $a20130815d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 200 10$aIan Frazer$b[electronic resource] $ethe man who saved a million lives /$fMadonna King 210 $aQueensland $cUniversity of Queensland Press$d2013 215 $a1 online resource (274 p.) 300 $aIncludes index. 311 $a0-7022-4957-2 311 $a1-306-00607-4 327 $aFront Cover; Half Title Page; Author Biography; Title Page; Copyright Page; Dedication; Prologue; Chapter One; Chapter Two; Chapter Three; Chapter Four; Chapter Five; Chapter Six; Chapter Seven; Chapter Eight; Chapter Nine; Chapter Ten; Chapter Eleven; Chapter Twelve; Chapter Thirteen; Chapter Fourteen; Chapter Fifteen; Chapter Sixteen; Chapter Seventeen; Chapter Eighteen; Chapter Nineteen; Chapter Twenty; Chapter Twenty-one; Chapter Twenty-two; Chapter Twenty-three; Chapter Twenty-four; Ian's Lemon meringue pie; Acknowledgements; Index; Picture Section 330 $a

An unforgettable story of perseverance and aspiration, this biography of Dr. Ian Frazer, the man whose vaccine for cervical cancer has helped save the lives of more than 275,000 women around the world each year, peels back the many layers of his extraordinary life. Given exclusive access to Frazer, biographer and journalist Madonna King tells of his ongoing struggle for funding cancer research, the herculean international legal battle waged to win the patent, the devastating loss of his friend and co researcher, Dr. Jian Zhou, and Frazer's ongoi 606 $aImmunologists$zAustralia$vBiography 606 $aMedical scientists$zAustralia$vBiography 615 0$aImmunologists 615 0$aMedical scientists 676 $a610.92 700 $aKing$b Madonna$01488246 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910790509903321 996 $aIan Frazer$93708488 997 $aUNINA LEADER 07327nam 22008175 450 001 9910143895303321 005 20230412075045.0 010 $a3-540-45708-9 024 7 $a10.1007/3-540-45708-9 035 $a(CKB)1000000000211829 035 $a(SSID)ssj0000320923 035 $a(PQKBManifestationID)11237998 035 $a(PQKBTitleCode)TC0000320923 035 $a(PQKBWorkID)10262565 035 $a(PQKB)10471807 035 $a(DE-He213)978-3-540-45708-4 035 $a(MiAaPQ)EBC3072477 035 $a(PPN)155166484 035 $a(EXLCZ)991000000000211829 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology - CRYPTO 2002 $e22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18-22, 2002. Proceedings /$fedited by Moti Yung 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 630 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v2442 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-44050-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aBlock Ciphers -- Essential Algebraic Structure within the AES -- Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC -- Tweakable Block Ciphers -- Multi-user Oriented Cryptosystems -- The LSD Broadcast Encryption Scheme -- Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials -- Foundations and Methodology -- Provably Secure Steganography -- Flaws in Applying Proof Methodologies to Signature Schemes -- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case -- Security of Practical Protocols -- On the Security of RSA Encryption in TLS -- Security Analysis of IKE?s Signature-Based Key-Exchange Protocol -- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks -- Secure Multiparty Computation -- On 2-Round Secure Multiparty Computation -- Private Computation ? k-Connected versus 1-Connected Networks -- Public-Key Encryption -- Analysis and Improvements of NTRU Encryption Paddings -- Universal Padding Schemes for RSA -- Cryptanalysis of Unbalanced RSA with Small CRT-Exponent -- Information Theory and Secret Sharing -- Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors -- Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups -- Cipher Design and Analysis -- A Generalized Birthday Problem -- (Not So) Random Shuffles of RC4 -- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV -- Elliptic Curves and Abelian Varieties -- Supersingular Abelian Varieties in Cryptology -- Efficient Algorithms for Pairing-Based Cryptosystems -- Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2 -- Password-Based Authentication -- Threshold Password-Authenticated Key Exchange -- Distributed Cryptosystems -- A Threshold Pseudorandom Function Construction and Its Applications -- Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products -- Pseudorandomness and Applications -- Hidden Number Problem with the Trace and Bit Security of XTR and LUC -- Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security -- Variations on Signatures and Authentication -- Threshold Ring Signatures and Applications to Ad-hoc Groups -- Deniable Ring Authentication -- SiBIR: Signer-Base Intrusion-Resilient Signatures -- Stream Ciphers and Boolean Functions -- Cryptanalysis of Stream Ciphers with Linear Masking -- The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers -- A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction -- Commitment Schemes -- Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks -- Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor -- Signature Schemes -- Unique Signatures and Verifiable Random Functions from the DH-DDH Separation -- Security Proof for Partial-Domain Hash Signature Schemes. 330 $aCrypto 2002, the 22nd Annual Crypto Conference, was sponsored by IACR, the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. It is published as Vol. 2442 of the Lecture Notes in Computer Science (LNCS) of Springer Verlag. Note that 2002, 22 and 2442 are all palindromes... (Don?t nod!) Theconferencereceived175submissions,ofwhich40wereaccepted;twos- missionsweremergedintoasinglepaper,yieldingthetotalof39papersaccepted for presentation in the technical program of the conference. In this proceedings volume you will ?nd the revised versions of the 39 papers that were presented at the conference. The submissions represent the current state of work in the cryptographic community worldwide, covering all areas of cryptologic research. In fact, many high-quality works (that surely will be published elsewhere) could not be accepted. This is due to the competitive nature of the conference and the challenging task of selecting a program. I wish to thank the authors of all submitted papers. Indeed, it is the authors of all papers who have made this conference possible, regardless of whether or not their papers were accepted. The conference program was also immensely bene?ted by two plenary talks. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v2442 606 $aCryptography 606 $aData encryption (Computer science) 606 $aData protection 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aOperating systems (Computers) 606 $aElectronic data processing?Management 606 $aCryptology 606 $aData and Information Security 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aOperating Systems 606 $aIT Operations 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aData protection. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aOperating systems (Computers) 615 0$aElectronic data processing?Management. 615 14$aCryptology. 615 24$aData and Information Security. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aOperating Systems. 615 24$aIT Operations. 676 $a005.8/2 702 $aYung$b Moti$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCRYPTO (Conference) 906 $aBOOK 912 $a9910143895303321 996 $aAdvances in Cryptology - CRYPTO 2002$92204554 997 $aUNINA