000 06040nam a22005535i 4500
001 978-3-540-48405-9
003 DE-He213
005 20160624102034.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540484059
_9978-3-540-48405-9
024 7 _a10.1007/3-540-48405-1
_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 — CRYPTO’ 99
_h[electronic resource] :
_b19th Annual International Cryptology Conference Santa Barbara, California, USA, August 15–19, 1999 Proceedings /
_cedited by Michael Wiener.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1999.
300 _aXII, 648 p.
_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 ;
_v1666
505 0 _aPublic-Key Cryptanalysis I -- On the Security of RSA Padding -- Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization -- The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications -- Invited Lecture -- Information-Theoretic Cryptography -- Secure Communication and Computation -- Information Theoretically Secure Communication in the Limited Storage Space Model -- The All-or-Nothing Nature of Two-Party Secure Computation -- Distributed Cryptography -- Adaptive Security for Threshold Cryptosystems -- Two Party RSA Key Generation -- Robust Distributed Multiplication without Interaction -- A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting -- Secret-Key Cryptography -- Truncated Differentials and Skipjack -- Fast Correlation Attacks Based on Turbo Code Techniques -- Highly Nonlinear Resilient Functions Optimizing Siegenthaler’s Inequality -- Message Authentication Codes -- UMAC: Fast and Secure Message Authentication -- Square Hash: Fast Message Authentication via Optimized Universal Hash Functions -- Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions -- Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier -- Public-Key Cryptanalysis II -- Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97 -- Weakness in Quaternion Signatures -- Cryptanalysis of “2R” Schemes -- Factoring N = p r q for Large r -- Traitor Tracing -- An Efficient Public Key Traitor Tracing Scheme -- Dynamic Traitor Tracing -- Efficient Methods for Integrating Traceability and Broadcast Encryption -- Differential Power Analysis -- Differential Power Analysis -- Towards Sound Approaches to Counteract Power-Analysis Attacks -- Signature Schemes -- Separability and Efficiency for Generic Group Signature Schemes -- A Forward-Secure Digital Signature Scheme -- Abuse-Free Optimistic Contract Signing -- Zero Knowledge -- Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK -- On Concurrent Zero-Knowledge with Pre-processing -- Asymmetric Encryption -- On the Security Properties of OAEP as an All-or-Nothing Transform -- Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization -- Secure Integration of Asymmetric and Symmetric Encryption Schemes -- Electronic Cash -- Auditable, Anonymous Electronic Cash -- Protocols and Broadcasting -- Oblivious Transfer with Adaptive Queries -- Compressing Cryptographic Resources -- Coding Constructions for Blacklisting Problems without Computational Assumptions -- An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes.
520 _aCrypto ’99, the Nineteenth Annual Crypto Conference, was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department, University of California, Santa Barbara (UCSB). The General Chair, Donald Beaver, was responsible for local organization and registration. The Program Committee considered 167 papers and selected 38 for presentation. This year’s conference program also included two invited lectures. I was pleased to include in the program UeliM aurer’s presentation “Information Theoretic Cryptography” and Martin Hellman’s presentation “The Evolution of Public Key Cryptography.” The program also incorporated the traditional Rump Session for informal short presentations of new results, run by Stuart Haber. These proceedings include the revised versions of the 38 papers accepted by the Program Committee. These papers were selected from all the submissions to the conference based on originality, quality, and relevance to the field of cryptology. Revisions were not checked, and the authors bear full responsibility for the contents of their papers.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData encryption (Computer science).
650 0 _aComputer software.
650 0 _aInformation Systems.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aManagement of Computing and Information Systems.
650 2 4 _aComputer Communication Networks.
650 2 4 _aComputational Mathematics and Numerical Analysis.
700 1 _aWiener, Michael.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540663478
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1666
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-48405-1
942 _2EBK6456
_cEBK
999 _c35750
_d35750