LEADER 01235nam0-2200385---450 001 990005726440203316 005 20190403125017.0 035 $a000572644 035 $aUSA01000572644 035 $a(ALEPH)000572644USA01 035 $a000572644 100 $a20070828d1980----|||y0itaa50------ba 101 $afre 102 $afr 105 $a0 00||| 200 1 $a<> technologie introuvable$erecerche sur la définition et l'unité de la Technologie à partir de quelques modèles du 18. et 19. siècles$fpar Jean-Claude Beaune 210 $aParis$cVrin$d1980 215 $a285 p.$d22 cm. 225 2 $a<> histoire des sciences. Textes et études 410 0$12001$a<> histoire des sciences. Textes et études 606 $aTECNOLOGIA$xFILOSOFIA E TEORIA$2F 620 $dPARIS 676 $a601 700 1$aBEAUNE,$bJean-Claude$0280375 801 0$aIT$bSA$c20111219 912 $a990005726440203316 950 0$aDipar.to di Filosofia - Salerno$dDFCC 601 BEA$e1595 FIL 951 $aCC 601 BEA$b1595 FIL 959 $aBK 969 $aFIL 979 $c20121027$lUSA01$h1526 979 $c20121027$lUSA01$h1615 996 $aTechnologie introuvable$91083239 997 $aUNISA NUM $aSA0021970 LEADER 05235nam 2200613 450 001 996465527903316 005 20220423062816.0 010 $a3-540-89255-9 024 7 $a10.1007/978-3-540-89255-7 035 $a(CKB)1000000000545759 035 $a(SSID)ssj0000315802 035 $a(PQKBManifestationID)11230601 035 $a(PQKBTitleCode)TC0000315802 035 $a(PQKBWorkID)10255076 035 $a(PQKB)11138344 035 $a(DE-He213)978-3-540-89255-7 035 $a(MiAaPQ)EBC3063790 035 $a(MiAaPQ)EBC6691540 035 $a(Au-PeEL)EBL6691540 035 $a(PPN)132861445 035 $a(EXLCZ)991000000000545759 100 $a20220423d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAdvances in cryptology, ASIACRYPT 2008 $e14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008, proceedings /$fJosef Pieprzyk (editor) 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer-Verlag,$d[2008] 210 4$d©2008 215 $a1 online resource (XIV, 572 p.) 225 1 $aLecture Notes in Computer Science ;$v5350 300 $aInternational conference proceedings. 311 $a3-540-89254-0 320 $aIncludes bibliographical references and index. 327 $aMulti-Party Computation -- MPC vs. SFE : Unconditional and Computational Security -- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes -- Graph Design for Secure Multiparty Computation over Non-Abelian Groups -- Invited Talk -- Some Perspectives on Complexity-Based Cryptography -- Cryptographic Protocols I -- A Modular Security Analysis of the TLS Handshake Protocol -- Ambiguous Optimistic Fair Exchange -- Compact Proofs of Retrievability -- On the Security of HB# against a Man-in-the-Middle Attack -- Cryptographic Hash Functions I -- Hash Functions from Sigma Protocols and Improvements to VSH -- Slide Attacks on a Class of Hash Functions -- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography -- Cryptographic Protocols II -- Universally Composable Adaptive Oblivious Transfer -- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting -- Towards Robust Computation on Encrypted Data -- Efficient Protocols for Set Membership and Range Proofs -- Cryptographic Hash Functions II -- Preimage Attacks on 3, 4, and 5-Pass HAVAL -- How to Fill Up Merkle-Damgård Hash Functions -- Limits of Constructive Security Proofs -- Public-Key Cryptography I -- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption -- Twisted Edwards Curves Revisited -- On the Validity of the ?-Hiding Assumption in Cryptographic Protocols -- Chosen Ciphertext Security with Optimal Ciphertext Overhead -- Lattice-Based Cryptography -- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems -- Rigorous and Efficient Short Lattice Vectors Enumeration -- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits -- Private-Key Cryptography -- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity -- An Improved Impossible Differential Attack on MISTY1 -- Public-Key Cryptography II -- Generalized Identity Based and Broadcast Encryption Schemes -- Speeding Up the Pollard Rho Method on Prime Fields -- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems -- OAEP Is Secure under Key-Dependent Messages -- Analysis of Stream Ciphers -- Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks -- A New Attack on the LEX Stream Cipher -- Breaking the F-FCSR-H Stream Cipher in Real Time. 330 $aThis book constitutes the refereed proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008, held in Melbourne, Australia, in December 2008. The 33 revised full papers presented together with the abstract of 1 invited lecture were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on muliti-party computation, cryptographic protocols, cryptographic hash functions, public-key cryptograhy, lattice-based cryptography, private-key cryptograhy, and analysis of stream ciphers. 410 0$aLecture notes in computer science ;$v5350. 606 $aData encryption (Computer science)$vCongresses 606 $aComputer security$vCongresses 615 0$aData encryption (Computer science) 615 0$aComputer security 676 $a005.82 702 $aPieprzyk$b Josef 712 02$aInternational Association for Cryptologic Research. 712 12$aInternational Conference on the Theory and Application of Cryptology and Information Security 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465527903316 996 $aAdvances in Cryptology - ASIACRYPT 2008$9774076 997 $aUNISA