LEADER 06715nam 22008535 450 001 996465668703316 005 20230412072820.0 010 $a1-280-38725-4 010 $a9786613565174 010 $a3-642-13708-3 024 7 $a10.1007/978-3-642-13708-2 035 $a(CKB)2670000000028916 035 $a(SSID)ssj0000446301 035 $a(PQKBManifestationID)11314598 035 $a(PQKBTitleCode)TC0000446301 035 $a(PQKBWorkID)10495780 035 $a(PQKB)10210494 035 $a(DE-He213)978-3-642-13708-2 035 $a(MiAaPQ)EBC3065464 035 $a(PPN)149063970 035 $a(EXLCZ)992670000000028916 100 $a20100625d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApplied Cryptography and Network Security$b[electronic resource] $e8th International Conference, ACNS 2010, Beijing, China, June 22-25, 2010, Proceedings /$fedited by Jianying Zhou, Moti Yung 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIII, 564 p. 83 illus.) 225 1 $aSecurity and Cryptology ;$v6123 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13707-5 320 $aIncludes bibliographical references and index. 327 $aPublic Key Encryption -- On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption -- How to Construct Interval Encryption from Binary Tree Encryption -- Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions -- Digital Signature -- Trapdoor Sanitizable Signatures Made Easy -- Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs -- Redactable Signatures for Tree-Structured Data: Definitions and Constructions -- Block Ciphers and Hash Functions -- Impossible Differential Cryptanalysis on Feistel Ciphers with SP and SPS Round Functions -- Multi-trail Statistical Saturation Attacks -- Multiset Collision Attacks on Reduced-Round SNOW 3G and SNOW 3G??? -- High Performance GHASH Function for Long Messages -- Side-Channel Attacks -- Principles on the Security of AES against First and Second-Order Differential Power Analysis -- Adaptive Chosen-Message Side-Channel Attacks -- Secure Multiplicative Masking of Power Functions -- Zero Knowledge and Multi-party Protocols -- Batch Groth?Sahai -- Efficient and Secure Evaluation of Multivariate Polynomials and Applications -- Efficient Implementation of the Orlandi Protocol -- Improving the Round Complexity of Traitor Tracing Schemes -- Key Management -- Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parameters -- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead -- Deniable Internet Key Exchange -- Authentication and Identification -- A New Human Identification Protocol and Coppersmith?s Baby-Step Giant-Step Algorithm -- Secure Sketch for Multiple Secrets -- A Message Recognition Protocol Based on Standard Assumptions -- Privacy and Anonymity -- Affiliation-Hiding Key Exchange with Untrusted Group Authorities -- Privacy-Preserving Group Discovery with Linear Complexity -- Two New Efficient PIR-Writing Protocols -- Regulatory Compliant Oblivious RAM -- RFID Security and Privacy -- Revisiting Unpredictability-Based RFID Privacy Models -- On RFID Privacy with Mutual Authentication and Tag Corruption -- Internet Security -- Social Network-Based Botnet Command-and-Control: Emerging Threats and Countermeasures -- COP: A Step toward Children Online Privacy -- A Hybrid Method to Detect Deflation Fraud in Cost-Per-Action Online Advertising. 330 $aACNS 2010, the 8th International Conference on Applied Cryptography and Network Security, was held in Beijing, China, during June 22-25, 2010. ACNS 2010 brought together individuals from academia and industry involved in m- tiple research disciplines of cryptography and security to foster the exchange of ideas. ACNS was initiated in 2003, and there has been a steady improvement in the quality of its program over the past 8 years: ACNS 2003 (Kunming, China), ACNS 2004 (Yellow Mountain, China), ACNS 2005 (New York, USA), ACNS 2006 (Singapore), ACNS 2007 (Zhuhai, China), ACNS 2008 (New York, USA), ACNS2009(Paris,France). Theaverageacceptanceratehasbeenkeptataround 17%, and the average number of participants has been kept at around 100. The conference received a total of 178 submissions from all over the world. Each submission was assigned to at least three committee members. Subm- sions co-authored by members of the Program Committee were assigned to at least four committee members. Due to the large number of high-quality s- missions, the review process was challenging and we are deeply grateful to the committee members and the external reviewers for their outstanding work. - ter extensive discussions, the Program Committee selected 32 submissions for presentation in the academic track, and these are the articles that are included in this volume (LNCS 6123). Additionally, a few other submissionswereselected for presentation in the non-archival industrial track. 410 0$aSecurity and Cryptology ;$v6123 606 $aComputer networks 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aElectronic data processing?Management 606 $aAlgorithms 606 $aData protection 606 $aComputer Communication Networks 606 $aCryptology 606 $aDiscrete Mathematics in Computer Science 606 $aIT Operations 606 $aAlgorithms 606 $aData and Information Security 615 0$aComputer networks. 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aElectronic data processing?Management. 615 0$aAlgorithms. 615 0$aData protection. 615 14$aComputer Communication Networks. 615 24$aCryptology. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aIT Operations. 615 24$aAlgorithms. 615 24$aData and Information Security. 676 $a005.8 702 $aZhou$b Jianying$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aYung$b Moti$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aACNS 2010 906 $aBOOK 912 $a996465668703316 996 $aApplied Cryptography and Network Security$9771881 997 $aUNISA