000			04786nam a22006375i 4500
001			978-3-642-13013-7
003			DE-He213
005			20240730165431.0
007			cr nn 008mamaa
008			100514s2010 gw | s |||| 0|eng d
020			_a9783642130137 _9978-3-642-13013-7
024	7		_a10.1007/978-3-642-13013-7 _2doi
050		4	_aTK5105.5-5105.9
072		7	_aUKN _2bicssc
072		7	_aCOM043000 _2bisacsh
072		7	_aUKN _2thema
082	0	4	_a004.6 _223
245	1	0	_aPublic Key Cryptography - PKC 2010 _h[electronic resource] : _b13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings / _cedited by Phong Q. Nguyen, David Pointcheval.
250			_a1st ed. 2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010.
300			_aXIII, 519 p. 34 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSecurity and Cryptology, _x2946-1863 ; _v6056
505	0		_aEncryption I -- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model -- Constant Size Ciphertexts in Threshold Attribute-Based Encryption -- Cryptanalysis -- Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem -- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA -- Implicit Factoring with Shared Most Significant and Middle Bits -- Protocols I -- On the Feasibility of Consistent Computations -- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate -- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting -- Network Coding -- Secure Network Coding over the Integers -- Preventing Pollution Attacks in Multi-source Network Coding -- Tools -- Groth-Sahai Proofs Revisited -- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments -- Elliptic Curves -- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions -- Faster Pairing Computations on Curves with High-Degree Twists -- Efficient Arithmetic on Hessian Curves -- Lossy Trapdoor Functions -- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model -- More Constructions of Lossy and Correlation-Secure Trapdoor Functions -- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions -- Protocols II -- Efficient Set Operations in the Presence of Malicious Adversaries -- Text Search Protocols with Simulation Based Security -- Discrete Logarithm -- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ) -- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval -- Encryption II -- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Securityor Support for Negation -- Security of Encryption Schemes in Weakened Random Oracle Models -- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes -- Signatures -- Unlinkability of Sanitizable Signatures -- Confidential Signatures and Deterministic Signcryption -- Identity-Based Aggregate and Multi-Signature Schemes Based on RSA -- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More.
650		0	_aComputer networks . _931572
650		0	_aCryptography. _91973
650		0	_aData encryption (Computer science). _99168
650		0	_aElectronic data processing _xManagement. _988903
650		0	_aAlgorithms. _93390
650		0	_aData protection. _97245
650		0	_aComputer science _xMathematics. _93866
650		0	_aDiscrete mathematics. _912873
650	1	4	_aComputer Communication Networks. _988904
650	2	4	_aCryptology. _931769
650	2	4	_aIT Operations. _931703
650	2	4	_aAlgorithms. _93390
650	2	4	_aData and Information Security. _931990
650	2	4	_aDiscrete Mathematics in Computer Science. _931837
700	1		_aNguyen, Phong Q. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _988905
700	1		_aPointcheval, David. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _988906
710	2		_aSpringerLink (Online service) _988907
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642130120
776	0	8	_iPrinted edition: _z9783642130144
830		0	_aSecurity and Cryptology, _x2946-1863 ; _v6056 _988908
856	4	0	_uhttps://doi.org/10.1007/978-3-642-13013-7
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cELN
999			_c86309 _d86309