|
|
|
|
LEADER |
04050nmm a2200433 u 4500 |
001 |
EB000655609 |
003 |
EBX01000000000000001349166 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
140122 ||| eng |
020 |
|
|
|a 9783540400615
|
100 |
1 |
|
|a Laih, Chi Sung
|e [editor]
|
245 |
0 |
0 |
|a Advances in Cryptology - ASIACRYPT 2003
|h Elektronische Ressource
|b 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings
|c edited by Chi Sung Laih
|
250 |
|
|
|a 1st ed. 2003
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
300 |
|
|
|a XIV, 550 p
|b online resource
|
505 |
0 |
|
|a Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking -- New Parallel Domain Extenders for UOWHF -- Cryptanalysis of 3-Pass HAVAL -- Group Signatures -- Efficient Group Signatures without Trapdoors -- Accumulating Composites and Improved Group Signing -- Almost Uniform Density of Power Residues and the Provable Security of ESIGN -- Number Theory II -- Rotations and Translations of Number Field Sieve Polynomials -- On Class Group Computations Using the Number Field Sieve -- Invited Talk -- The Secret and Beauty of Ancient Chinese Padlocks -- Block Ciphers -- A Traceable Block Cipher -- A New Attack against Khazad -- Broadcast and Multicast -- An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack -- Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes -- Foundationsand Complexity Theory --
|
505 |
0 |
|
|a Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption -- On Diophantine Complexity and Statistical Zero-Knowledge Arguments -- Verifiable Homomorphic Oblivious Transfer and Private Equality Test -- Public Key Cryptography II -- Generalized Powering Functions and Their Application to Digital Signatures -- Certificateless Public Key Cryptography -- A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems -- The Insecurity of Esign in Practical Implementations -- Digital Signature -- Efficient One-Time Proxy Signatures -- Universal Designated-Verifier Signatures
|
505 |
0 |
|
|a Public Key Cryptography I -- Chosen-Ciphertext Security without Redundancy -- Some RSA-Based Encryption Schemes with Tight Security Reduction -- A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications -- Number Theory I -- Factoring Estimates for a 1024-Bit RSA Modulus -- Index Calculus Attack for Hyperelliptic Curves of Small Genus -- Efficient Implementations -- Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves -- Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p – x + d -- The AGM-X 0(N) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting -- Key Management and Protocols -- Key Management Schemes for Stateless Receivers Based on Time Varying Heterogeneous Logical Key Hierarchy -- Leakage-Resilient Authenticated Key Establishment Protocols -- Untraceable Fair Network Payment Protocols with Off-Line TTP -- Hash Functions --
|
653 |
|
|
|a Computer Communication Networks
|
653 |
|
|
|a Coding and Information Theory
|
653 |
|
|
|a Coding theory
|
653 |
|
|
|a Operating Systems
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Operating systems (Computers)
|
653 |
|
|
|a Cryptography
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Computer networks
|
653 |
|
|
|a Information theory
|
653 |
|
|
|a Data encryption (Computer science)
|
653 |
|
|
|a Cryptology
|
653 |
|
|
|a Discrete mathematics
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/b94617
|
856 |
4 |
0 |
|u https://doi.org/10.1007/b94617?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 005.824
|