000 | 05407nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-3-540-36288-3 | ||
003 | DE-He213 | ||
005 | 20160624101934.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540362883 _9978-3-540-36288-3 |
||
024 | 7 |
_a10.1007/3-540-36288-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
082 | 0 | 4 |
_a004 _223 |
245 | 1 | 0 |
_aPublic Key Cryptography — PKC 2003 _h[electronic resource] : _b6th International Workshop on Practice and Theory in Public Key Cryptography Miami, FL, USA, January 6–8, 2003 Proceedings / _cedited by Yvo G. Desmedt. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
300 |
_aXII, 376 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 ; _v2567 |
|
505 | 0 | _aDiffie-Hellman Based Schemes -- Efficient Construction of (Distributed) Verifiable Random Functions -- An Identity-Based Signature from Gap Diffie-Hellman Groups -- Threshold Cryptography -- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme -- An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack -- Reduction Proofs -- On the Bit Security of NTRUEncrypt -- Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks -- Broadcast and Tracing -- Randomness Re-use in Multi-recipient Encryption Schemeas -- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack -- Digital Signatures -- The Cramer-Shoup Strong-RSA Signature Scheme Revisited -- Strong Key-Insulated Signature Schemes -- Specialized Multiparty Cryptography -- A Verifiable Secret Shuffe of Homomorphic Encryptions -- Round-Optimal Contributory Conference Key Agreement -- Cryptanalysis I -- Security Analysis of the MOR Cryptosystem -- A Practical Attack on Some Braid Group Based Cryptographic Primitives -- Elliptic Curves:Implementation Attacks -- A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems -- Validation of Elliptic Curve Public Keys -- Exceptional Procedure Attack on Elliptic Curve Cryptosystems -- Implementation and Hardware Issues -- On Montgomery-Like Representations for Elliptic Curves over GF(2k) -- A Dedicated Sieving Hardware -- A Fast and Secure Implementation of Sflash -- New Public Key Schemes -- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes -- A Lattice Based Public Key Cryptosystem Using Polynomial Representations -- Elliptic Curves:General Issues -- The Security of DSA and ECDSA -- Cryptanalysis II -- Side-Channel Attacks on Textbook RSA and ElGamal Encryption -- On the Security of HFE, HFEv- and Quartz -- Generic Attacks and the Security of Quartz. | |
520 | _aPKC 2003 was the Sixth International Workshop on Practice and Theory in Public Key Cryptography and was sponsored by IACR, the International As- ciation for Cryptologic Research (www.iacr.org). This year the workshop was organized in cooperation with the Department of Computer Science, Florida State University. The General Chair, Mike Burmester was responsible for local organization, registration, etc. There were 105 submitted papers which were considered by the Program Committee. This is an increase of 52% compared to PKC 2002, which took place in Paris, France, February 2002, and which was incorrectly identi?ed on the cover of the proceedings as being the fourth workshop. Due to the large number of submissions, some papers that contained new ideas had to be rejected. Priority was given to novel papers. Of the 105 submissions, 26 were selected for the proceedings. These contain the revised versions of the accepted papers. Each paper was sent to at least 3 members of the program committee for comments. Revisions were not checked for correctness of their scienti?c aspects and the authors bear full responsibility for the contents of their papers. Some authors will write ?nal versions of their papers for publication in refereed journals. I am very grateful to the members of the Program Committee for their hard work in the di?cult task of selecting roughly 1 out of 4 of the submitted 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 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Science, general. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aData Encryption. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputers and Society. |
650 | 2 | 4 | _aManagement of Computing and Information Systems. |
700 | 1 |
_aDesmedt, Yvo G. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540003243 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2567 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-36288-6 |
942 |
_2EBK4264 _cEBK |
||
999 |
_c33558 _d33558 |