Advances in Cryptology - ASIACRYPT 2003 [[electronic resource] ] : 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings / / edited by Chi Sung Laih |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (XIV, 550 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Cryptology Coding and Information Theory Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
ISBN | 3-540-40061-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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 -- 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 -- Foundations and Complexity Theory -- 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. |
Record Nr. | UNISA-996465917303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2003 : 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings / / edited by Chi Sung Laih |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (XIV, 550 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Cryptology Coding and Information Theory Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
ISBN | 3-540-40061-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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 -- 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 -- Foundations and Complexity Theory -- 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. |
Record Nr. | UNINA-9910768163803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - ASIACRYPT 2009 [[electronic resource] ] : 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009, Proceedings / / edited by Mitsuri Matsui |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIV, 722 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer programming Discrete mathematics Algorithms Data structures (Computer science) Computer science—Mathematics Cryptology Programming Techniques Discrete Mathematics Algorithm Analysis and Problem Complexity Data Structures and Information Theory Discrete Mathematics in Computer Science |
Soggetto genere / forma |
Kongress.
Tokio (2009) |
ISBN | 3-642-10366-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Block Ciphers -- Related-Key Cryptanalysis of the Full AES-192 and AES-256 -- The Key-Dependent Attack on Block Ciphers -- Cascade Encryption Revisited -- Quantum and Post-Quantum -- Quantum-Secure Coin-Flipping and Applications -- On the Power of Two-Party Quantum Cryptography -- Security Bounds for the Design of Code-Based Cryptosystems -- Hash Functions I -- Rebound Attack on the Full Lane Compression Function -- Rebound Distinguishers: Results on the Full Whirlpool Compression Function -- MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners -- The Intel AES Instructions Set and the SHA-3 Candidates -- Encryption Schemes -- Group Encryption: Non-interactive Realization in the Standard Model -- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations -- Hierarchical Predicate Encryption for Inner-Products -- Hedged Public-Key Encryption: How to Protect against Bad Randomness -- Multi Party Computation -- Secure Two-Party Computation Is Practical -- Secure Multi-party Computation Minimizing Online Rounds -- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols -- Cryptographic Protocols -- Non-malleable Statistically Hiding Commitment from Any One-Way Function -- Proofs of Storage from Homomorphic Identification Protocols -- Simple Adaptive Oblivious Transfer without Random Oracle -- Hash Functions II -- Improved Generic Algorithms for 3-Collisions -- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical -- How to Confirm Cryptosystems Security: The Original Merkle-Damgård Is Still Alive! -- Models and Frameworks I -- On the Analysis of Cryptographic Assumptions in the Generic Ring Model -- Zero Knowledge in the Random Oracle Model, Revisited -- A Framework for Universally Composable Non-committing Blind Signatures -- Cryptanalysis: Sqaure and Quadratic -- Cryptanalysis of the Square Cryptosystems -- Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses -- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? -- Models and Frameworks II -- Security Notions and Generic Constructions for Client Puzzles -- Foundations of Non-malleable Hash and One-Way Functions -- Hash Functions III -- Improved Cryptanalysis of Skein -- Linearization Framework for Collision Attacks: Application to CubeHash and MD6 -- Preimages for Step-Reduced SHA-2 -- Lattice-Based -- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures -- Efficient Public Key Encryption Based on Ideal Lattices -- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices -- Side Channels -- PSS Is Secure against Random Fault Attacks -- Cache-Timing Template Attacks -- Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions -- Signature Schemes with Bounded Leakage Resilience. |
Record Nr. | UNISA-996465928203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2009 : 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009, Proceedings / / edited by Mitsuri Matsui |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIV, 722 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer programming Discrete mathematics Algorithms Data structures (Computer science) Computer science—Mathematics Cryptology Programming Techniques Discrete Mathematics Algorithm Analysis and Problem Complexity Data Structures and Information Theory Discrete Mathematics in Computer Science |
Soggetto genere / forma |
Kongress.
Tokio (2009) |
ISBN | 3-642-10366-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Block Ciphers -- Related-Key Cryptanalysis of the Full AES-192 and AES-256 -- The Key-Dependent Attack on Block Ciphers -- Cascade Encryption Revisited -- Quantum and Post-Quantum -- Quantum-Secure Coin-Flipping and Applications -- On the Power of Two-Party Quantum Cryptography -- Security Bounds for the Design of Code-Based Cryptosystems -- Hash Functions I -- Rebound Attack on the Full Lane Compression Function -- Rebound Distinguishers: Results on the Full Whirlpool Compression Function -- MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners -- The Intel AES Instructions Set and the SHA-3 Candidates -- Encryption Schemes -- Group Encryption: Non-interactive Realization in the Standard Model -- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations -- Hierarchical Predicate Encryption for Inner-Products -- Hedged Public-Key Encryption: How to Protect against Bad Randomness -- Multi Party Computation -- Secure Two-Party Computation Is Practical -- Secure Multi-party Computation Minimizing Online Rounds -- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols -- Cryptographic Protocols -- Non-malleable Statistically Hiding Commitment from Any One-Way Function -- Proofs of Storage from Homomorphic Identification Protocols -- Simple Adaptive Oblivious Transfer without Random Oracle -- Hash Functions II -- Improved Generic Algorithms for 3-Collisions -- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical -- How to Confirm Cryptosystems Security: The Original Merkle-Damgård Is Still Alive! -- Models and Frameworks I -- On the Analysis of Cryptographic Assumptions in the Generic Ring Model -- Zero Knowledge in the Random Oracle Model, Revisited -- A Framework for Universally Composable Non-committing Blind Signatures -- Cryptanalysis: Square and Quadratic -- Cryptanalysis of the Square Cryptosystems -- Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses -- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? -- Models and Frameworks II -- Security Notions and Generic Constructions for Client Puzzles -- Foundations of Non-malleable Hash and One-Way Functions -- Hash Functions III -- Improved Cryptanalysis of Skein -- Linearization Framework for Collision Attacks: Application to CubeHash and MD6 -- Preimages for Step-Reduced SHA-2 -- Lattice-Based -- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures -- Efficient Public Key Encryption Based on Ideal Lattices -- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices -- Side Channels -- PSS Is Secure against Random Fault Attacks -- Cache-Timing Template Attacks -- Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions -- Signature Schemes with Bounded Leakage Resilience. |
Record Nr. | UNINA-9910483947503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - ASIACRYPT 2010 [[electronic resource] ] : 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings / / edited by Masayuki Abe |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 634 p. 70 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Management information systems Computer science Computer science—Mathematics Computer security Applied mathematics Engineering mathematics Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Discrete Mathematics in Computer Science Systems and Data Security Applications of Mathematics |
ISBN |
1-280-39053-0
9786613568458 3-642-17373-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Hash Attacks -- Rotational Rebound Attacks on Reduced Skein -- Finding Second Preimages of Short Messages for Hamsi-256 -- Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl -- Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2 -- Collision Attacks against the Knudsen-Preneel Compression Functions -- Symmetric-Key Cryptosystems -- Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions -- The World Is Not Enough: Another Look on Second-Order DPA -- Block and Stream Ciphers -- Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems -- A Byte-Based Guess and Determine Attack on SOSEMANUK -- Improved Single-Key Attacks on 8-Round AES-192 and AES-256 -- Protocols -- Constant-Size Commitments to Polynomials and Their Applications -- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries -- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model -- Key Exchange -- Generic Compilers for Authenticated Key Exchange -- A Forward-Secure Symmetric-Key Derivation Protocol -- Foundation -- Efficient String-Commitment from Weak Bit-Commitment -- On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields -- Random Oracles with(out) Programmability -- Zero-Knowledge -- Short Pairing-Based Non-interactive Zero-Knowledge Arguments -- Short Non-interactive Zero-Knowledge Proofs -- Optimistic Concurrent Zero Knowledge -- Lattice-Based Cryptography -- Faster Fully Homomorphic Encryption -- A Group Signature Scheme from Lattice Assumptions -- Lattice-Based Blind Signatures -- Secure Communication and Computation -- The Round Complexity of Verifiable Secret Sharing: The Statistical Case -- General Perfectly Secure Message Transmission Using Linear Codes -- On Invertible Sampling and Adaptive Security -- Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition -- Models, Notions, and Assumptions -- A Closer Look at Anonymity and Robustness in Encryption Schemes -- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures -- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography -- Public-Key Encryption -- The Degree of Regularity of HFE Systems -- Structured Encryption and Controlled Disclosure -- Leakage Resilient ElGamal Encryption -- Efficient Public-Key Cryptography in the Presence of Key Leakage. |
Record Nr. | UNISA-996465949903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2010 [[electronic resource] ] : 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings / / edited by Masayuki Abe |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 634 p. 70 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Management information systems Computer science Computer science—Mathematics Computer security Applied mathematics Engineering mathematics Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Discrete Mathematics in Computer Science Systems and Data Security Applications of Mathematics |
ISBN |
1-280-39053-0
9786613568458 3-642-17373-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Hash Attacks -- Rotational Rebound Attacks on Reduced Skein -- Finding Second Preimages of Short Messages for Hamsi-256 -- Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl -- Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2 -- Collision Attacks against the Knudsen-Preneel Compression Functions -- Symmetric-Key Cryptosystems -- Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions -- The World Is Not Enough: Another Look on Second-Order DPA -- Block and Stream Ciphers -- Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems -- A Byte-Based Guess and Determine Attack on SOSEMANUK -- Improved Single-Key Attacks on 8-Round AES-192 and AES-256 -- Protocols -- Constant-Size Commitments to Polynomials and Their Applications -- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries -- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model -- Key Exchange -- Generic Compilers for Authenticated Key Exchange -- A Forward-Secure Symmetric-Key Derivation Protocol -- Foundation -- Efficient String-Commitment from Weak Bit-Commitment -- On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields -- Random Oracles with(out) Programmability -- Zero-Knowledge -- Short Pairing-Based Non-interactive Zero-Knowledge Arguments -- Short Non-interactive Zero-Knowledge Proofs -- Optimistic Concurrent Zero Knowledge -- Lattice-Based Cryptography -- Faster Fully Homomorphic Encryption -- A Group Signature Scheme from Lattice Assumptions -- Lattice-Based Blind Signatures -- Secure Communication and Computation -- The Round Complexity of Verifiable Secret Sharing: The Statistical Case -- General Perfectly Secure Message Transmission Using Linear Codes -- On Invertible Sampling and Adaptive Security -- Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition -- Models, Notions, and Assumptions -- A Closer Look at Anonymity and Robustness in Encryption Schemes -- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures -- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography -- Public-Key Encryption -- The Degree of Regularity of HFE Systems -- Structured Encryption and Controlled Disclosure -- Leakage Resilient ElGamal Encryption -- Efficient Public-Key Cryptography in the Presence of Key Leakage. |
Record Nr. | UNINA-9910484643303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - ASIACRYPT 2013 [[electronic resource] ] : 19th International Conference on the Theory and Application of Cryptology and Information, Bengaluru, India, December 1-5, 2013, Proceedings, Part I / / edited by Kazue Sako, Palash Sarkar |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XXIV, 546 p. 82 illus.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Management information systems Computer science Computer science—Mathematics Computer security Applied mathematics Engineering mathematics Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Discrete Mathematics in Computer Science Systems and Data Security Applications of Mathematics |
ISBN | 3-642-42033-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Message Authentication Codes -- Signatures -- Cryptography Based Upon Physical Assumptions -- Multi-Party Computation -- Cryptographic Primitives -- Analysis, Cryptanalysis and Passwords -- Leakage-Resilient Cryptography -- Two-Party Computation -- Hash Functions. |
Record Nr. | UNISA-996465559903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2013 : 19th International Conference on the Theory and Application of Cryptology and Information, Bengaluru, India, December 1-5, 2013, Proceedings, Part I / / edited by Kazue Sako, Palash Sarkar |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XXIV, 546 p. 82 illus.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Algorithms Management information systems Computer science Computer science—Mathematics Computer security Applied mathematics Engineering mathematics Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Discrete Mathematics in Computer Science Systems and Data Security Applications of Mathematics |
ISBN | 3-642-42033-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Message Authentication Codes -- Signatures -- Cryptography Based Upon Physical Assumptions -- Multi-Party Computation -- Cryptographic Primitives -- Analysis, Cryptanalysis and Passwords -- Leakage-Resilient Cryptography -- Two-Party Computation -- Hash Functions. |
Record Nr. | UNINA-9910484063003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - CRYPTO '98 [[electronic resource] ] : 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings / / edited by Hugo Krawczyk |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XII, 524 p.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Computer security Computers Computer science—Mathematics Computer communication systems Management information systems Computer science Cryptology Systems and Data Security Theory of Computation Discrete Mathematics in Computer Science Computer Communication Networks Management of Computing and Information Systems |
ISBN | 3-540-68462-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1 -- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack -- Relations among notions of security for public-key encryption schemes -- Cryptography and the internet -- Differential collisions in SHA-0 -- From differential cryptanalysis to ciphertext-only attacks -- A simplified approach to threshold and proactive RSA -- New efficient and secure protocols for verifiable signature sharing and other applications -- Trading correctness for privacy in unconditional multi-party computation -- Fast digital identity revocation -- Self-delegation with controlled propagation — or — What if you lose your laptop -- Identity escrow -- Generalized birthday attacks on unbalanced Feistel networks -- Quadratic relation of S-box and its application to the linear attack of full round DES -- Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree -- Cryptanalysis of the Ajtai-Dwork cryptosystem -- Cryptanalysis of the Chor-Rivest cryptosystem -- Cryptanalysis of the oil and vinegar signature scheme -- From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs -- Many-to-one trapdoor functions and their relation to public-key cryptosystems -- Authentication, enhanced security and error correcting codes -- An efficient discrete log pseudo random generator -- Fast RSA-type cryptosystem modulo p k q -- An elliptic curve implementation of the finite field digital signature algorithm -- Quantum bit commitment from a physical assumption -- On concrete security treatment of signatures derived from identification -- Building PRFs from PRPs -- Security amplification by composition: The case of doubly-iterated, ideal ciphers -- On the existence of 3-round zero-knowledge protocols -- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? -- Concurrent zero-knowledge: Reducing the need for timing constraints -- The solution of McCurley's discrete log challenge -- Optimal extension fields for fast arithmetic in public-key algorithms -- Time-stamping with binary linking schemes -- Threshold traitor tracing. |
Record Nr. | UNISA-996466138803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - CRYPTO '98 [[electronic resource] ] : 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings / / edited by Hugo Krawczyk |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XII, 524 p.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Computer security Computers Computer science—Mathematics Computer communication systems Management information systems Computer science Cryptology Systems and Data Security Theory of Computation Discrete Mathematics in Computer Science Computer Communication Networks Management of Computing and Information Systems |
ISBN | 3-540-68462-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1 -- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack -- Relations among notions of security for public-key encryption schemes -- Cryptography and the internet -- Differential collisions in SHA-0 -- From differential cryptanalysis to ciphertext-only attacks -- A simplified approach to threshold and proactive RSA -- New efficient and secure protocols for verifiable signature sharing and other applications -- Trading correctness for privacy in unconditional multi-party computation -- Fast digital identity revocation -- Self-delegation with controlled propagation — or — What if you lose your laptop -- Identity escrow -- Generalized birthday attacks on unbalanced Feistel networks -- Quadratic relation of S-box and its application to the linear attack of full round DES -- Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree -- Cryptanalysis of the Ajtai-Dwork cryptosystem -- Cryptanalysis of the Chor-Rivest cryptosystem -- Cryptanalysis of the oil and vinegar signature scheme -- From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs -- Many-to-one trapdoor functions and their relation to public-key cryptosystems -- Authentication, enhanced security and error correcting codes -- An efficient discrete log pseudo random generator -- Fast RSA-type cryptosystem modulo p k q -- An elliptic curve implementation of the finite field digital signature algorithm -- Quantum bit commitment from a physical assumption -- On concrete security treatment of signatures derived from identification -- Building PRFs from PRPs -- Security amplification by composition: The case of doubly-iterated, ideal ciphers -- On the existence of 3-round zero-knowledge protocols -- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? -- Concurrent zero-knowledge: Reducing the need for timing constraints -- The solution of McCurley's discrete log challenge -- Optimal extension fields for fast arithmetic in public-key algorithms -- Time-stamping with binary linking schemes -- Threshold traitor tracing. |
Record Nr. | UNINA-9910767583803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|