Advances in Cryptology - EUROCRYPT 2007  26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings /  [electronic resource] : 
edited by Moni Naor. 
 - 1st ed. 2007. 
 - XIII, 591 p.  online resource. 
 - Security and Cryptology,  4515  2946-1863 ; .
 - Security and Cryptology,  4515 .
<br/><br/>Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities -- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist -- The Collision Intractability of MDC-2 in the Ideal-Cipher Model -- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries -- Revisiting the Efficiency of Malicious Two-Party Computation -- Efficient Two-Party Secure Computation on Committed Inputs -- Universally Composable Multi-party Computation Using Tamper-Proof Hardware -- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model -- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability -- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility -- Zero Knowledge and Soundness Are Symmetric -- Mesh Signatures -- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks -- Batch Verification of Short Signatures -- Cryptanalysis of SFLASH with Slightly Modified Parameters -- Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy -- Secure Computation from Random Error Correcting Codes -- Round-Efficient Secure Computation in Point-to-Point Networks -- Atomic Secure Multi-party Multiplication with Low Communication -- Cryptanalysis of the Sidelnikov Cryptosystem -- Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables -- An L (1/3?+??) Algorithm for the Discrete Logarithm Problem for Low Degree Curves -- General Ad Hoc Encryption from Exponent Inversion IBE -- Non-interactive Proofs for Integer Multiplication -- Ate Pairing on Hyperelliptic Curves -- Ideal Multipartite Secret Sharing Schemes -- Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt toCope with 1024-Bit -- Divisible E-Cash Systems Can Be Truly Anonymous -- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security -- Range Extension for Weak PRFs; The Good, the Bad, and the Ugly -- Feistel Networks Made Public, and Applications -- Oblivious-Transfer Amplification -- Simulatable Adaptive Oblivious Transfer. 
<br/><br/><label>ISBN: </label>9783540725404 
<br/><br/><label>Standard No.: </label>10.1007/978-3-540-72540-4  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Cryptography.<br/>Data encryption (Computer science).<br/>Computer networks .<br/>Data protection.<br/>Algorithms.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Electronic data processing--Management.<br/>Cryptology.<br/>Computer Communication Networks.<br/>Data and Information Security.<br/>Algorithms.<br/>Discrete Mathematics in Computer Science.<br/>IT Operations.
<br/><br/><label>LC Class. No.: </label>QA268 
<br/><br/><label>Dewey Class. No.: </label>005.824