000			04006nam a22005535i 4500
001			978-3-540-46588-1
003			DE-He213
005			20160624102016.0
007			cr nn 008mamaa
008			121227s2000 gw | s |||| 0|eng d
020			_a9783540465881 _9978-3-540-46588-1
024	7		_a10.1007/b75033 _2doi
050		4	_aQA76.9.A25
072		7	_aURY _2bicssc
072		7	_aCOM053000 _2bisacsh
082	0	4	_a005.82 _223
245	1	0	_aPublic Key Cryptography _h[electronic resource] : _bThird International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings / _cedited by Hideki Imai, Yuliang Zheng.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000.
300			_aXIV, 490 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 ; _v1751
505	0		_aA Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol -- An Efficient NICE-Schnorr-Type Signature Scheme -- Identification of Bad Signatures in Batches -- Some Remarks on a Fair Exchange Protocol -- Gaudry’s Variant against C ab Curves -- An Identification Scheme Based on Sparse Polynomials -- A State-Based Model for Certificate Management Systems -- Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence -- The Composite Discrete Logarithm and Secure Authentication -- Chosen-Ciphertext Security for Any One-Way Cryptosystem -- Short Proofs of Knowledge for Factoring -- Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms -- All-or-Nothing Transform and Remotely Keyed Encryption Protocols -- Security of Public Key Certificate Based Authentication Protocols -- Efficient Implementation of Schoof’s Algorithm in Case of Characteristic 2 -- Key Recovery in Third Generation Wireless Communication Systems -- Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications -- Certificates of Recoverability with Scalable Recovery Agent Security -- Design Validations for Discrete Logarithm Based Signature Schemes -- Optimally Efficient Accountable Time-Stamping -- “Pseudorandom Intermixing”: A Tool for Shared Cryptography -- RSA-Based Auto-recoverable Cryptosystems -- Efficient and Fresh Certification -- Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions -- Cryptographic Approaches to Privacy in Forensic DNA Databases -- Making Hash Functions from Block Ciphers Secure and Efficient by Using Convolutional Codes -- Fast Implementation of Elliptic Curve Arithmetic in GF(p n ) -- An Auction Protocol Which Hides Bids of Losers -- Forward Secrecy and Its Application to Future Mobile Communications Security -- Selecting Cryptographic Key Sizes -- A Structured ElGamal-Type Multisignature Scheme.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aOperating systems (Computers).
650		0	_aData encryption (Computer science).
650		0	_aComputer software.
650		0	_aInformation Systems.
650	1	4	_aComputer Science.
650	2	4	_aData Encryption.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aOperating Systems.
650	2	4	_aComputer Communication Networks.
650	2	4	_aManagement of Computing and Information Systems.
700	1		_aImai, Hideki. _eeditor.
700	1		_aZheng, Yuliang. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540669678
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1751
856	4	0	_uhttp://dx.doi.org/10.1007/b75033
942			_2EBK5828 _cEBK
999			_c35122 _d35122