000 04052nam a22005655i 4500
001 978-3-540-78967-3
003 DE-He213
005 20160624102118.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540789673
_9978-3-540-78967-3
024 7 _a10.1007/978-3-540-78967-3
_2doi
050 4 _aQA76.9.A25
072 7 _aURY
_2bicssc
072 7 _aCOM053000
_2bisacsh
082 0 4 _a005.82
_223
245 1 0 _aAdvances in Cryptology – EUROCRYPT 2008
_h[electronic resource] :
_b27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings /
_cedited by Nigel Smart.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4965
505 0 _aA Practical Attack on KeeLoq -- Key Recovery on Hidden Monomial Multivariate Schemes -- Predicting Lattice Reduction -- Efficient Sequential Aggregate Signed Data -- Proving Tight Security for Rabin-Williams Signatures -- Threshold RSA for Dynamic and Ad-Hoc Groups -- Towards Key-Dependent Message Security in the Standard Model -- The Twin Diffie-Hellman Problem and Applications -- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products -- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves -- On the Indifferentiability of the Sponge Construction -- A New Mode of Operation for Block Ciphers and Length-Preserving MACs -- Security/Efficiency Tradeoffs for Permutation-Based Hashing -- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Collisions for the LPS Expander Graph Hash Function -- Second Preimage Attacks on Dithered Hash Functions -- Efficient Two Party and Multi Party Computation Against Covert Adversaries -- Almost-Everywhere Secure Computation -- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme -- Protocols and Lower Bounds for Failure Localization in the Internet -- : Increasing the Security and Efficiency of -- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle -- Precise Concurrent Zero Knowledge -- Efficient Non-interactive Proof Systems for Bilinear Groups -- Zero-Knowledge Sets with Short Proofs -- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves -- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors -- Obfuscating Point Functions with Multibit Output -- Isolated Proofs of Knowledge and Isolated Zero Knowledge -- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware -- New Constructions for UC Secure Computation Using Tamper-Proof Hardware.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData protection.
650 0 _aData encryption (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aComputer Communication Networks.
650 2 4 _aSystems and Data Security.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aManagement of Computing and Information Systems.
700 1 _aSmart, Nigel.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540789666
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4965
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-78967-3
942 _2EBK8066
_cEBK
999 _c37360
_d37360