000 06282nam a22005535i 4500
001 978-3-540-48071-6
003 DE-He213
005 20160624102029.0
007 cr nn 008mamaa
008 121227s1993 gw | s |||| 0|eng d
020 _a9783540480716
_9978-3-540-48071-6
024 7 _a10.1007/3-540-48071-4
_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’ 92
_h[electronic resource] :
_b12th Annual International Cryptology Conference Santa Barbara, California, USA August 16–20, 1992 Proceedings /
_cedited by Ernest F. Brickell.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
300 _aX, 593 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 ;
_v740
505 0 _aDigital Signatures and Identification I -- Provably Unforgeable Signatures -- New Constructions of Fail-Stop Signatures and Lower Bounds -- Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes -- An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z n -- The Digital Signature Standard -- Designing and Detecting Trapdoors for Discrete Log Cryptosystems -- Response to Comments on the NIST Proposed Digital Signature Standard -- Applications and New Problems -- Wallet Databases with Observers -- Making Electronic Refunds Safer -- Fair Public-Key Cryptosystems -- Pricing via Processing or Combatting Junk Mail -- Secret Sharing I -- On the Information Rate of Secret Sharing Schemes -- New General Lower Bounds on the Information Rate of Secret Sharing Schemes -- Universally Ideal Secret Sharing Schemes -- Theory I -- Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions -- Low communication 2-prover zero-knowledge proofs for NP -- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent -- On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols -- Cryptographic Functions -- On the Design of SP Networks from an Information Theoretic Point of View -- Partially-bent functions -- Digital Signatures and Identifcation II -- Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks -- On the Security of the Permuted Kernel Identification Scheme -- Computational Number Theory -- Massively Parallel Computation of Discrete Logarithms -- A Quadratic Sieve on the n-Dimensional Cube -- Efficient Multiplication on Certain Nonsupersingular Elliptic Curves -- Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method -- On Generation of Probable Primes by Incremental Search -- Cryptography Education -- Kid Krypto -- Theory II -- On Defining Proofs of Knowledge -- Public Randomness in Cryptography -- Necessary and Sufficient Conditions for Collision-Free Hashing -- Certifying Cryptographic Tools: The Case of Trapdoor Permutations -- Key Distribution -- Protocols for Secret Key Agreement by Public Discussion Based on Common Information -- Perfectly-Secure Key Distribution for Dynamic Conferences -- DES -- Differential Cryptanalysis of the Full 16-round DES -- Iterative Characteristics of DES and s2-DES -- DES is not a Group -- A High-speed DES Implementation for Network Applications -- Secret Sharing II -- Threshold Schemes with Disenrollment -- Non-existence of homomorphic general sharing schemes for some key spaces -- An l-Span Generalized Secret Sharing Scheme -- Rump Session -- Provable Security Against Differential Cryptanalysis -- Content-Addressable Search Engines and DES-like Systems -- FFT-Hash-II is not yet Collision-free.
520 _aCrypto'92 took place on August 16-20, 1992. It was the twelfth in the series of annual cryptology conferences held on the beautiful campus of the University of California, Santa Barbara. Once again, it was sponsored by the International Association for Cryptologic Research, in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy. The conference ran smoothly, due to the diligent efforts of the g- eral chair, Spyros Magliveras of the University of Nebraska. One of the measures of the success of this series of conferences is represented by the ever increasing number of papers submitted. This year, there were 135 submissions to the c- ference, which represents a new record. Following the practice of recent program comm- tees, the papers received anonymous review. The program committee accepted 38 papers for presentation. In addition, there were two invited presentations, one by Miles Smid on the Digital Signature Standard, and one by Mike Fellows on presenting the concepts of cryptology to elementary-age students. These proceedings contains these 40 papers plus 3 papers that were presented at the Rump Session. I would like to thank all of the authors of the submitted papers and all of the speakers who presented papers. I would like to express my sincere appreciation to the work of the program committee: Ivan Damgard (Aarhus University, Denmark), Odd Goldreich (Technion, Israel), Burt Kaliski (RSA Data Security, USA), Joe Kilian (NEC, USA).
650 0 _aComputer science.
650 0 _aOperating systems (Computers).
650 0 _aData encryption (Computer science).
650 0 _aCoding theory.
650 0 _aDatabase management.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aCoding and Information Theory.
650 2 4 _aDatabase Management.
650 2 4 _aCombinatorics.
650 2 4 _aOperating Systems.
700 1 _aBrickell, Ernest F.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540573401
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v740
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-48071-4
942 _2EBK6306
_cEBK
999 _c35600
_d35600