International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings Herausgegeben:Preneel, Bart
International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings Herausgegeben:Preneel, Bart
EUROCRYPT 2000, the nineteenth annual Eurocrypt Conference, was sp- sored by the International Association for Cryptologic Research (IACR), in - operation with the Katholieke Universiteit Leuven in Belgium (research group for Computer Security and Industrial Cryptography, COSIC). The r st conference with the name Eurocrypt took place in 1983, but the 1982 Workshop at Burg Feuerstein was the r st open meeting in Europe on cryptology; it has been included in Lecture Notes in Computer Science 1440, which containsan electronic proceedings and index ofthe Crypto and Eurocrypt conferences 1981{1997.…mehr
EUROCRYPT 2000, the nineteenth annual Eurocrypt Conference, was sp- sored by the International Association for Cryptologic Research (IACR), in - operation with the Katholieke Universiteit Leuven in Belgium (research group for Computer Security and Industrial Cryptography, COSIC). The r st conference with the name Eurocrypt took place in 1983, but the 1982 Workshop at Burg Feuerstein was the r st open meeting in Europe on cryptology; it has been included in Lecture Notes in Computer Science 1440, which containsan electronic proceedings and index ofthe Crypto and Eurocrypt conferences 1981{1997. The program committee considered 150 papers and selected 39 for pres- tation at EUROCRYPT 2000. One paper was withdrawn by the authors. The program also included invited talks by Michael Walker (On the Security of 3GPP Networks") and Tony Sale (Colossus and the German Lorenz Cipher { Code Breaking in WW II"). In addition, Andy Clark kindly agreed to chair the traditional rump session for informal presentations of recent results.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Artikelnr. des Verlages: 10720212, 978-3-540-67517-4
2000.
Seitenzahl: 628
Erscheinungstermin: 3. Mai 2000
Englisch
Abmessung: 235mm x 155mm x 34mm
Gewicht: 866g
ISBN-13: 9783540675174
ISBN-10: 3540675175
Artikelnr.: 23303895
Herstellerkennzeichnung
Books on Demand GmbH
In de Tarpen 42
22848 Norderstedt
info@bod.de
040 53433511
Inhaltsangabe
Factoring and Discrete Logarithm. Factorization of a 512 Bit RSA Modulus. An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. Analysis and Optimization of the TWINKLE Factoring Device. Cryptanalysis I: Digital Signatures. Noisy Polynomial Interpolation and Noisy Chinese Remaindering. A Chosen Messages Attack on the ISO/IEC 9796 1 Signature Scheme. Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796 1. Security Analysis of the Gennaro Halevi Rabin Signature Scheme. Invited Talk. On the Security of 3GPP Networks. Private Information Retrieval. One Way Trapdoor Permutations Are Sufficient for Non trivial Single Server Private Information Retrieval. Single Database Private Information Retrieval Implies Oblivious Transfer. Key Management Protocols. Authenticated Key Exchange Secure against Dictionary Attacks. Provably Secure Password Authenticated Key Exchange Using Diffie Hellman. Fair Encryption of RSA Keys. Threshold Cryptography and Digital Signatures. Computing Inverses over a Shared Secret Modulus. Practical Threshold Signatures. Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. Confirmer Signature Schemes Secure against Adaptive Adversaries. Public Key Encryption. Public Key Encryption in a Multi user Setting: Security Proofs and Improvements. Using Hash Functions as a Hedge against Chosen Ciphertext Attack. Quantum Cryptography. Security Aspects of Practical Quantum Cryptography. Perfectly Concealing Quantum Bit Commitment from any Quantum One Way Permutation. Multi party Computation and Information Theory. General Secure Multi party Computation from any Linear Secret Sharing Scheme. Minimal Latency Secure Function Evaluation. Information Theoretic Key Agreement: From Weak to Strong Secrecy for Free. Cryptanalysis II: Public Key Encryption. New Attacks on PKCS#1 v1.5 Encryption. A NICE Cryptanalysis. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. Cryptanalysis of Patarin's 2 Round Public Key System with S Boxes (2R). Invited Talk. Colossus and the German Lorenz Cipher Code Breaking in WW II. Zero Knowledge. Efficient Concurrent Zero Knowledge in the Auxiliary String Model. Efficient Proofs that a Committed Number Lies in an Interval. Symmetric Cryptography. A Composition Theorem for Universal One Way Hash Functions. Exposure Resilient Functions and All or Nothing Transforms. The Sum of PRPs Is a Secure PRF. Boolean Functions and Hardware. Construction of Nonlinear Boolean Functions with Important Cryptographic Properties. Propagation Characteristics and Correlation Immunity of Highly Nonlinear Boolean Functions. Cox Rower Architecture for Fast Parallel Montgomery Multiplication. Voting Schemes. Efficient Receipt Free Voting Based on Homomorphic Encryption. How to Break a Practical MIX and Design a New One. Cryptanalysis III: Stream Ciphers and Block Ciphers. Improved Fast Correlation Attacks Using Parity Check Equations of Weight 4 and 5. Advanced Slide Attacks.
Factoring and Discrete Logarithm. Factorization of a 512 Bit RSA Modulus. An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. Analysis and Optimization of the TWINKLE Factoring Device. Cryptanalysis I: Digital Signatures. Noisy Polynomial Interpolation and Noisy Chinese Remaindering. A Chosen Messages Attack on the ISO/IEC 9796 1 Signature Scheme. Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796 1. Security Analysis of the Gennaro Halevi Rabin Signature Scheme. Invited Talk. On the Security of 3GPP Networks. Private Information Retrieval. One Way Trapdoor Permutations Are Sufficient for Non trivial Single Server Private Information Retrieval. Single Database Private Information Retrieval Implies Oblivious Transfer. Key Management Protocols. Authenticated Key Exchange Secure against Dictionary Attacks. Provably Secure Password Authenticated Key Exchange Using Diffie Hellman. Fair Encryption of RSA Keys. Threshold Cryptography and Digital Signatures. Computing Inverses over a Shared Secret Modulus. Practical Threshold Signatures. Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. Confirmer Signature Schemes Secure against Adaptive Adversaries. Public Key Encryption. Public Key Encryption in a Multi user Setting: Security Proofs and Improvements. Using Hash Functions as a Hedge against Chosen Ciphertext Attack. Quantum Cryptography. Security Aspects of Practical Quantum Cryptography. Perfectly Concealing Quantum Bit Commitment from any Quantum One Way Permutation. Multi party Computation and Information Theory. General Secure Multi party Computation from any Linear Secret Sharing Scheme. Minimal Latency Secure Function Evaluation. Information Theoretic Key Agreement: From Weak to Strong Secrecy for Free. Cryptanalysis II: Public Key Encryption. New Attacks on PKCS#1 v1.5 Encryption. A NICE Cryptanalysis. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. Cryptanalysis of Patarin's 2 Round Public Key System with S Boxes (2R). Invited Talk. Colossus and the German Lorenz Cipher Code Breaking in WW II. Zero Knowledge. Efficient Concurrent Zero Knowledge in the Auxiliary String Model. Efficient Proofs that a Committed Number Lies in an Interval. Symmetric Cryptography. A Composition Theorem for Universal One Way Hash Functions. Exposure Resilient Functions and All or Nothing Transforms. The Sum of PRPs Is a Secure PRF. Boolean Functions and Hardware. Construction of Nonlinear Boolean Functions with Important Cryptographic Properties. Propagation Characteristics and Correlation Immunity of Highly Nonlinear Boolean Functions. Cox Rower Architecture for Fast Parallel Montgomery Multiplication. Voting Schemes. Efficient Receipt Free Voting Based on Homomorphic Encryption. How to Break a Practical MIX and Design a New One. Cryptanalysis III: Stream Ciphers and Block Ciphers. Improved Fast Correlation Attacks Using Parity Check Equations of Weight 4 and 5. Advanced Slide Attacks.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
