000 04163nam a22006135i 4500
001 978-3-540-30580-4
003 DE-He213
005 20240423125755.0
007 cr nn 008mamaa
008 100705s2005 gw | s |||| 0|eng d
020 _a9783540305804
_9978-3-540-30580-4
024 7 _a10.1007/b105124
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aPublic Key Cryptography - PKC 2005
_h[electronic resource] :
_b8th International Workshop on Theory and Practice in Public Key Cryptography /
_cedited by Serge Vaudenay.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 436 p.
_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 ;
_v3386
505 0 _aCryptanalysis -- A New Related Message Attack on RSA -- Breaking a Cryptographic Protocol with Pseudoprimes -- Experimenting with Faults, Lattices and the DSA -- Key Establishment -- Securing RSA-KEM via the AES -- One-Time Verifier-Based Encrypted Key Exchange -- Password-Based Authenticated Key Exchange in the Three-Party Setting -- Optimization -- On the Optimization of Side-Channel Attacks by Advanced Stochastic Methods -- Symmetric Subgroup Membership Problems -- Building Blocks -- Optimizing Robustness While Generating Shared Secret Safe Primes -- Fast Multi-computations with Integer Similarity Strategy -- Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order -- Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries -- RSA Cryptography -- Converse Results to the Wiener Attack on RSA -- RSA with Balanced Short Exponents and Its Application to Entity Authentication -- The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity -- From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited -- Multivariate Asymmetric Cryptography -- Tractable Rational Map Signature -- Cryptanalysis of the Tractable Rational Map Cryptosystem -- Large Superfluous Keys in ultivariate uadratic Asymmetric Systems -- Cryptanalysis of HFEv and Internal Perturbation of HFE -- Signature Schemes -- A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible -- Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring -- The Security of the FDH Variant of Chaum’s Undeniable Signature Scheme -- Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions -- Identity-Based Cryptography -- Improved Identity-Based Signcryption -- EfficientMulti-receiver Identity-Based Encryption and Its Application to Broadcast Encryption -- CBE from CL-PKE: A Generic Construction and Efficient Schemes -- Best Paper Award -- A Verifiable Random Function with Short Proofs and Keys.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer networks .
650 0 _aComputers and civilization.
650 0 _aElectronic data processing
_xManagement.
650 1 4 _aCryptology.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Communication Networks.
650 2 4 _aComputers and Society.
650 2 4 _aIT Operations.
700 1 _aVaudenay, Serge.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540244547
776 0 8 _iPrinted edition:
_z9783540807261
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v3386
856 4 0 _uhttps://doi.org/10.1007/b105124
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181555
_d181555