Pieprzyk / Seberry / Safavi-Naini | Information Security and Privacy | Buch | 978-3-540-65756-9 | sack.de

Buch, Englisch, Band 1587, 332 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1080 g

Reihe: Lecture Notes in Computer Science

Pieprzyk / Seberry / Safavi-Naini

Information Security and Privacy

4th Australasian Conference, ACISP'99, Wollongong, NSW, Australia, April 7-9, 1999, Proceedings

Buch, Englisch, Band 1587, 332 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1080 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-65756-9
Verlag: Springer Berlin Heidelberg


AustralianComputerSociety GeneralChair: JenniferSeberry UniversityofWollongong ProgramCo-Chairs: JosefPieprzyk UniversityofWollongong ReiSafavi-Naini UniversityofWollongong ProgramCommittee: ColinBoyd QueenslandUniversityofTechnology,Australia LawrieBrown AustralianDefenceForceAcademy,Australia BillCaelli QueenslandUniversityofTechnology,Australia EdDawson QueenslandUniversityofTechnology,Australia CunshengDing NationalUniversityofSingapore,Singapore DieterGollmann MicrosoftResearch,UK YongfeiHan Gemplus,Singapore ThomasHardjono BayNetworks,US ErlandJonsson ChalmersUniversity,Sweden SveinKnapskog UniversityofTrondheim,Norway KeithMartin KatholiekeUniversiteitLeuven,Belgium CathyMeadows NavalResearchLaboratory,US KaisaNyberg NokiaResearchCenter,Finland Choon-SikPark ElectronicsandTelecommunicationResearchInstitute,Korea DingyiPei AcademiaSinica,China SteveRoberts WithamPtyLtd,Australia ConferenceOrganization VII GregRose Qualcomm,Australia RaviSandhu GeorgeMasonUniversity,US Sta ordTavares Queen’sUniversity,Canada VijayVaradharajan WesternSydneyUniversity,Australia YuliangZheng MonashUniversity,Australia Referees N. Asokan ZhangJiang DingyiPei YunBai ErlandJonsson JosefPieprzyk SimonBlackburn SveinKnapskog VincentRijmen ColinBoyd HuLei SteveRoberts LawrieBrown LeszekMaciaszek GregRose BillCaelli KeithMartin ReiSafavi-Naini EdDawson CathyMeadows RaviSandhu CunshengDing BillMillan RajanShankaran GaryGaskell QiMing Sta ordTavares JanuszGetta Sang-JaeMoon VijayVaradharajan DieterGollmann YiMu Kapaleeswaran MarcGysin KennyNguyen Viswanathan YongfeiHan KaisaNyberg ChuanWu ThomasHardjono Choon-SikPark YuliangZheng. TableofContents BooleanFunctions BooleanFunctionDesignUsingHillClimbingMethods WilliamMillan,AndrewClark,andEdDawson. 1 EnumerationofCorrelationImmuneBooleanFunctions SubhamoyMaitraandPalashSarkar. 12 OntheSymmetricPropertyofHomogeneousBooleanFunctions ChengxinQu,JenniferSeberry,andJosefPieprzyk. 26 KeyManagement PubliclyVeri ableKeyEscrowwithLimitedTimeSpan KapaliViswanathan,ColinBoyd,andEdDawson. 36 AcceleratingKeyEstablishmentProtocolsforMobileCommunication SeungwonLee,Seong-MinHong,HyunsooYoon,andYookunCho. 51 ConferenceKeyAgreementfromSecretSharing Chih-HungLiandJosefPieprzyk. 64 Cryptanalysis Onm-PermutationProtectionSchemeAgainstModi cationAttack W. W. FungandJ. W. Gray,III. 77 InversionAttackandBranching JovanDj. Golic, AndrewClark,andEdDawson. 88 Signatures Fail-StopThresholdSignatureSchemesBasedonEllipticCurves WillySusilo,ReiSafavi-Naini,andJosefPieprzyk. 103 DivertibleZero-KnowledgeProofofPolynomialRelationsand BlindGroupSignature KhanhQuocNguyen,YiMu,andVijayVaradharajan. 117 RepudiationofCheatingandNon-repudiationof Zhang’sProxySignatureSchemes HosseinGhodosiandJosefPieprzyk. 129 X TableofContents RSACryptosystems OntheSecurityofanRSABasedEncryptionScheme SigunaMul ¨ler. 135 GeneralisedCyclingAttacksonRSAandStrongRSAPrimes MarcGysinandJenniferSeberry. 149 RSAAccelerationwithFieldProgrammableGateArrays AlexanderTiountchikandElenaTrichina. 164 GroupCryptography ChangingThresholdsintheAbsenceofSecureChannels KeithM. Martin,JosefPieprzyk,ReiSafavi-Naini,andHuaxiongWang. 177 ASelf-Certi edGroup-OrientedCryptosystemWithoutaCombiner ShahrokhSaeedniaandHosseinGhodosi. 192 NetworkSecurity CompanionVirusesandtheMacintosh:ThreatsandCountermeasures Je reyHortonandJenniferSeberry. 202 AnImplementationofaSecureVersionofNFSIncludingRBAC PaulAshley,BradleyBroom,andMarkVandenwauver.
Pieprzyk / Seberry / Safavi-Naini Information Security and Privacy jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Boolean Functions.- Boolean Function Design Using Hill Climbing Methods.- Enumeration of Correlation Immune Boolean Functions.- On the Symmetric Property of Homogeneous Boolean Functions.- Key Management.- Publicly Verifiable Key Escrow with Limited Time Span.- Accelerating Key Establishment Protocols for Mobile Communication.- Conference Key Agreement from Secret Sharing.- Cryptanalysis.- On m-Permutation Protection Scheme against Modification Attack.- Inversion Attack and Branching.- Signatures.- Fail-Stop Threshold Signature Schemes Based on Elliptic Curves.- Divertible Zero-Knowledge Proof of Polynomial Relations and Blind Group Signature.- Repudiation of Cheating and Non-repudiation of Zhang’s Proxy Signature Schemes.- RSA Cryptosystems.- On the Security of an RSA Based Encryption Scheme.- Generalised Cycling Attacks on RSA and Strong RSA Primes.- RSA Acceleration with Field Programmable Gate Arrays.- Group Cryptography.- Changing Thresholds in the Absence of Secure Channels.- A Self-Certified Group-Oriented Cryptosystem without a Combiner.- Network Security.- Companion Viruses and the Macintosh: Threats and Countermeasures.- An Implementation of a Secure Version of NFS Including RBAC.- Electronic Commerce.- Group Signatures and Their Relevance to Privacy-Protecting Offline Electronic Cash Systems.- Effient Electronic Cash Using Batch Signatures.- Evolution of Fair Non-repudiation with TTP.- Access Control.- Authorization in Object Oriented Databases.- An Analysis of Access Control Models.- Odds and Ends.- Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems.- Characterization of Optimal Authentication Codes with Arbitration.- A Functional Cryptosystem Using a Group Action.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.