Public Key Cryptography - PKC 2005 8th International Workshop on Theory and Practice in Public Key Cryptography

Bibliographic Details
Other Authors: Vaudenay, Serge (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005, 2005
Edition:1st ed. 2005
Series:Security and Cryptology
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03345nmm a2200385 u 4500
001 EB000374506
003 EBX01000000000000000227558
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540305804 
100 1 |a Vaudenay, Serge  |e [editor] 
245 0 0 |a Public Key Cryptography - PKC 2005  |h Elektronische Ressource  |b 8th International Workshop on Theory and Practice in Public Key Cryptography  |c edited by Serge Vaudenay 
250 |a 1st ed. 2005 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2005, 2005 
300 |a XIV, 436 p  |b online resource 
505 0 |a Cryptanalysis -- 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 --  
505 0 |a CBE from CL-PKE: A Generic Construction and Efficient Schemes -- Best Paper Award -- A Verifiable Random Function with Short Proofs and Keys 
505 0 |a 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 --  
653 |a Computer Communication Networks 
653 |a Computers and Society 
653 |a Cryptography 
653 |a Electronic data processing / Management 
653 |a Algorithms 
653 |a Computer networks  
653 |a Data encryption (Computer science) 
653 |a Cryptology 
653 |a IT Operations 
653 |a Computers and civilization 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Security and Cryptology 
028 5 0 |a 10.1007/b105124 
856 4 0 |u https://doi.org/10.1007/b105124?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.824