Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advances in Cryptology – EUROCRYPT 2001 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann
| Advances in Cryptology – EUROCRYPT 2001 [[electronic resource] ] : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 544 p. 23 illus.) |
| Disciplina | 652.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Management information systems Computer science Computer communication systems Algorithms Computer mathematics Cryptology Mathematics of Computing Management of Computing and Information Systems Computer Communication Networks Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44987-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Elliptic Curves -- A Memory Efficient Version of Satoh’s Algorithm -- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy -- How Secure Are Elliptic Curves over Composite Extension Fields? -- Commitments -- Efficient and Non-interactive Non-malleable Commitment -- How to Convert the Flavor of a Quantum Bit Commitment -- Anonymity -- Cryptographic Counters and Applications to Electronic Voting -- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation -- Priced Oblivious Transfer: How to Sell Digital Goods -- Signatures and Hash Functions -- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures -- Practical Threshold RSA Signatures without a Trusted Dealer -- Hash Functions: From Merkle-Damgård to Shoup -- XTR and NTRU -- Key Recovery and Message Attacks on NTRU-Composite -- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems -- NSS: An NTRU Lattice-Based Signature Scheme -- Assumptions -- The Bit Security of Paillier’s Encryption Scheme and Its Applications -- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference -- Multiparty Protocols -- On Adaptive vs. Non-adaptive Security of Multiparty Protocols -- Multiparty Computation from Threshold Homomorphic Encryption -- On Perfect and Adaptive Security in Exposure-Resilient Cryptography -- Block Ciphers -- Cryptanalysis of Reduced-Round MISTY -- The Rectangle Attack — Rectangling the Serpent -- Primitives -- Efficient Amplification of the Security of Weak Pseudo-random Function Generators -- Min-round Resettable Zero-Knowledge in the Public-Key Model -- Symmetric Ciphers -- Structural Cryptanalysis of SASAS -- Hyper-bent Functions -- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs -- Key Exchange and Multicast -- Lower Bounds for Multicast Message Authentication -- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels -- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords -- Authentication and Identification -- Identification Protocols Secure against Reset Attacks -- Does Encryption with Redundancy Provide Authenticity? -- Encryption Modes with Almost Free Message Integrity. |
| Record Nr. | UNISA-996466163203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann
| Advances in Cryptology – EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings / / edited by Birgit Pfitzmann |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 544 p. 23 illus.) |
| Disciplina | 652.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Management information systems Computer science Computer communication systems Algorithms Computer mathematics Cryptology Mathematics of Computing Management of Computing and Information Systems Computer Communication Networks Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-44987-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Elliptic Curves -- A Memory Efficient Version of Satoh’s Algorithm -- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy -- How Secure Are Elliptic Curves over Composite Extension Fields? -- Commitments -- Efficient and Non-interactive Non-malleable Commitment -- How to Convert the Flavor of a Quantum Bit Commitment -- Anonymity -- Cryptographic Counters and Applications to Electronic Voting -- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation -- Priced Oblivious Transfer: How to Sell Digital Goods -- Signatures and Hash Functions -- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures -- Practical Threshold RSA Signatures without a Trusted Dealer -- Hash Functions: From Merkle-Damgård to Shoup -- XTR and NTRU -- Key Recovery and Message Attacks on NTRU-Composite -- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems -- NSS: An NTRU Lattice-Based Signature Scheme -- Assumptions -- The Bit Security of Paillier’s Encryption Scheme and Its Applications -- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference -- Multiparty Protocols -- On Adaptive vs. Non-adaptive Security of Multiparty Protocols -- Multiparty Computation from Threshold Homomorphic Encryption -- On Perfect and Adaptive Security in Exposure-Resilient Cryptography -- Block Ciphers -- Cryptanalysis of Reduced-Round MISTY -- The Rectangle Attack — Rectangling the Serpent -- Primitives -- Efficient Amplification of the Security of Weak Pseudo-random Function Generators -- Min-round Resettable Zero-Knowledge in the Public-Key Model -- Symmetric Ciphers -- Structural Cryptanalysis of SASAS -- Hyper-bent Functions -- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs -- Key Exchange and Multicast -- Lower Bounds for Multicast Message Authentication -- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels -- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords -- Authentication and Identification -- Identification Protocols Secure against Reset Attacks -- Does Encryption with Redundancy Provide Authenticity? -- Encryption Modes with Almost Free Message Integrity. |
| Record Nr. | UNINA-9910143605503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – EUROCRYPT 2002 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings / / edited by Lars Knudsen
| Advances in Cryptology – EUROCRYPT 2002 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings / / edited by Lars Knudsen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 552 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Algorithms Computer science—Mathematics Management information systems Computer science Computer communication systems Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
| ISBN | 3-540-46035-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis I -- Cryptanalysis of a Pseudorandom Generator Based on Braid Groups -- Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups -- Extending the GHS Weil Descent Attack -- Public-Key Encryption -- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption -- Key-Insulated Public Key Cryptosystems -- On the Security of Joint Signature and Encryption -- Invited Talk -- AES and the Wide Trail Design Strategy -- Information Theory & New Models -- Indistinguishability of Random Systems -- How to Fool an Unbounded Adversary with a Short Key -- Cryptography in an Unbounded Computational Model -- Implementational Analysis -- Performance Analysis and Parallel Implementation of Dedicated Hash Functions -- Fault Injection and a Timing Channel on an Analysis Technique -- Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms -- Stream Ciphers -- Fast Correlation Attacks: An Algorithmic Point of View -- BDD-Based Cryptanalysis of Keystream Generators -- Linear Cryptanalysis of Bluetooth Stream Cipher -- Digital Signatures I -- Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups -- Optimal Security Proofs for PSS and Other Signature Schemes -- Cryptanalysis II -- Cryptanalysis of SFLASH -- Cryptanalysis of the Revised NTRU Signature Scheme -- Key Exchange -- Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions -- Universally Composable Notions of Key Exchange and Secure Channels -- On Deniability in Quantum Key Exchange -- Modes of Operation -- A Practice-Oriented Treatment of Pseudorandom Number Generators -- A Block-Cipher Mode of Operation for Parallelizable Message Authentication -- Invited Talk -- Rethinking PKI: What’s Trust Got to Do with It? -- Digital Signatures II -- Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods -- From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security -- Security Notions for Unconditionally Secure Signature Schemes -- Traitor Tracking & Id-Based Encryption -- Traitor Tracing with Constant Transmission Rate -- Toward Hierarchical Identity-Based Encryption -- Multiparty and Multicast -- Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch -- Perfectly Secure Message Transmission Revisited -- Symmetric Cryptology -- Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis -- Security Flaws Induced by CBC Padding — Applications to SSL, IPSEC, WTLS... |
| Record Nr. | UNISA-996466256503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2002 : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings / / edited by Lars Knudsen
| Advances in Cryptology – EUROCRYPT 2002 : International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002 Proceedings / / edited by Lars Knudsen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 552 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Algorithms Computer science—Mathematics Management information systems Computer science Computer communication systems Cryptology Coding and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
| ISBN | 3-540-46035-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis I -- Cryptanalysis of a Pseudorandom Generator Based on Braid Groups -- Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups -- Extending the GHS Weil Descent Attack -- Public-Key Encryption -- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption -- Key-Insulated Public Key Cryptosystems -- On the Security of Joint Signature and Encryption -- Invited Talk -- AES and the Wide Trail Design Strategy -- Information Theory & New Models -- Indistinguishability of Random Systems -- How to Fool an Unbounded Adversary with a Short Key -- Cryptography in an Unbounded Computational Model -- Implementational Analysis -- Performance Analysis and Parallel Implementation of Dedicated Hash Functions -- Fault Injection and a Timing Channel on an Analysis Technique -- Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms -- Stream Ciphers -- Fast Correlation Attacks: An Algorithmic Point of View -- BDD-Based Cryptanalysis of Keystream Generators -- Linear Cryptanalysis of Bluetooth Stream Cipher -- Digital Signatures I -- Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups -- Optimal Security Proofs for PSS and Other Signature Schemes -- Cryptanalysis II -- Cryptanalysis of SFLASH -- Cryptanalysis of the Revised NTRU Signature Scheme -- Key Exchange -- Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions -- Universally Composable Notions of Key Exchange and Secure Channels -- On Deniability in Quantum Key Exchange -- Modes of Operation -- A Practice-Oriented Treatment of Pseudorandom Number Generators -- A Block-Cipher Mode of Operation for Parallelizable Message Authentication -- Invited Talk -- Rethinking PKI: What’s Trust Got to Do with It? -- Digital Signatures II -- Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods -- From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security -- Security Notions for Unconditionally Secure Signature Schemes -- Traitor Tracking & Id-Based Encryption -- Traitor Tracing with Constant Transmission Rate -- Toward Hierarchical Identity-Based Encryption -- Multiparty and Multicast -- Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch -- Perfectly Secure Message Transmission Revisited -- Symmetric Cryptology -- Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis -- Security Flaws Induced by CBC Padding — Applications to SSL, IPSEC, WTLS... |
| Record Nr. | UNINA-9910768439903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – EUROCRYPT 2003 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings / / edited by Eli Biham
| Advances in Cryptology – EUROCRYPT 2003 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings / / edited by Eli Biham |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XIV, 654 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Data encryption (Computer science) Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Programming Languages, Compilers, Interpreters Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-39200-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis I -- Cryptanalysis of the EMD Mode of Operation -- On the Optimality of Linear, Differential, and Sequential Distinguishers -- A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms -- Secure Multi-party Computation I -- Two-Threshold Broadcast and Detectable Multi-party Computation -- On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions -- Fair Secure Two-Party Computation -- Invited Talk I -- Facts and Myths of Enigma: Breaking Stereotypes -- Zero-Knowledge Protocols -- Resettable Zero-Knowledge in the Weak Public-Key Model -- Simulatable Commitments and Efficient Concurrent Zero-Knowledge -- Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition -- Strengthening Zero-Knowledge Protocols Using Signatures -- Foundations and Complexity Theoretic Security -- Nearly One-Sided Tests and the Goldreich-Levin Predicate -- Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications -- Public Key Encryption -- A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem -- A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions -- A Forward-Secure Public-Key Encryption Scheme -- Certificate-Based Encryption and the Certificate Revocation Problem -- New Primitives -- CAPTCHA: Using Hard AI Problems for Security -- Concealment and Its Applications to Authenticated Encryption -- Cryptanalysis II -- Predicting the Shrinking Generator with Fixed Connections -- Algebraic Attacks on Stream Ciphers with Linear Feedback -- Elliptic Curves Cryptography -- Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time -- The GHS Attack Revisited -- Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms -- Digital Signatures -- A Signature Scheme as Secure as the Diffie-Hellman Problem -- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps -- Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures -- Invited Talk II -- Why Provable Security Matters? -- Cryptanalysis III -- On the Security of RDSA -- Cryptanalysis of the Public-Key Encryption Based on Braid Groups -- A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications -- Key Exchange -- Provably Secure Threshold Password-Authenticated Key Exchange -- A Framework for Password-Based Authenticated Key Exchange -- Information Theoretic Cryptography -- The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations -- New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction -- Secure Multi-party Computation II -- Round Efficiency of Multi-party Computation with a Dishonest Majority -- Efficient Multi-party Computation over Rings -- Group Signatures -- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions -- Extracting Group Signatures from Traitor Tracing Schemes. |
| Record Nr. | UNISA-996466027803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2003 : International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings / / edited by Eli Biham
| Advances in Cryptology – EUROCRYPT 2003 : International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings / / edited by Eli Biham |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XIV, 654 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Data encryption (Computer science) Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Programming Languages, Compilers, Interpreters Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-39200-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis I -- Cryptanalysis of the EMD Mode of Operation -- On the Optimality of Linear, Differential, and Sequential Distinguishers -- A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms -- Secure Multi-party Computation I -- Two-Threshold Broadcast and Detectable Multi-party Computation -- On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions -- Fair Secure Two-Party Computation -- Invited Talk I -- Facts and Myths of Enigma: Breaking Stereotypes -- Zero-Knowledge Protocols -- Resettable Zero-Knowledge in the Weak Public-Key Model -- Simulatable Commitments and Efficient Concurrent Zero-Knowledge -- Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition -- Strengthening Zero-Knowledge Protocols Using Signatures -- Foundations and Complexity Theoretic Security -- Nearly One-Sided Tests and the Goldreich-Levin Predicate -- Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications -- Public Key Encryption -- A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem -- A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions -- A Forward-Secure Public-Key Encryption Scheme -- Certificate-Based Encryption and the Certificate Revocation Problem -- New Primitives -- CAPTCHA: Using Hard AI Problems for Security -- Concealment and Its Applications to Authenticated Encryption -- Cryptanalysis II -- Predicting the Shrinking Generator with Fixed Connections -- Algebraic Attacks on Stream Ciphers with Linear Feedback -- Elliptic Curves Cryptography -- Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time -- The GHS Attack Revisited -- Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms -- Digital Signatures -- A Signature Scheme as Secure as the Diffie-Hellman Problem -- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps -- Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures -- Invited Talk II -- Why Provable Security Matters? -- Cryptanalysis III -- On the Security of RDSA -- Cryptanalysis of the Public-Key Encryption Based on Braid Groups -- A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications -- Key Exchange -- Provably Secure Threshold Password-Authenticated Key Exchange -- A Framework for Password-Based Authenticated Key Exchange -- Information Theoretic Cryptography -- The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations -- New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction -- Secure Multi-party Computation II -- Round Efficiency of Multi-party Computation with a Dishonest Majority -- Efficient Multi-party Computation over Rings -- Group Signatures -- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions -- Extracting Group Signatures from Traitor Tracing Schemes. |
| Record Nr. | UNINA-9910143855603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – EUROCRYPT 2004 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch
| Advances in Cryptology – EUROCRYPT 2004 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 630 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN |
1-280-30737-4
9786610307371 3-540-24676-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Private Computation -- Efficient Private Matching and Set Intersection -- Positive Results and Techniques for Obfuscation -- Secure Computation of the k th -Ranked Element -- Signatures I -- Short Signatures Without Random Oracles -- Sequential Aggregate Signatures from Trapdoor Permutations -- Unconditional Security -- On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission -- The Exact Price for Unconditionally Secure Asymmetric Cryptography -- On Generating the Initial Key in the Bounded-Storage Model -- Distributed Cryptography -- Practical Large-Scale Distributed Key Generation -- Optimal Communication Complexity of Generic Multicast Key Distribution -- Foundations I -- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem -- Black-Box Composition Does Not Imply Adaptive Security -- Identity-Based Encryption -- Chosen-Ciphertext Security from Identity-Based Encryption -- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles -- Elliptic Curves -- Construction of Secure Random Curves of Genus 2 over Prime Fields -- Projective Coordinates Leak -- Signatures II -- Security Proofs for Identity-Based Identification and Signature Schemes -- Concurrent Signatures -- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures -- Public-Key Cryptography -- Public-Key Steganography -- Immunizing Encryption Schemes from Decryption Errors -- Secure Hashed Diffie-Hellman over Non-DDH Groups -- Foundations II -- On Simulation-Sound Trapdoor Commitments -- Hash Function Balance and Its Impact on Birthday Attacks -- Multiparty Computation -- Multi-party Computation with Hybrid Security -- On the Hardness of Information-Theoretic Multiparty Computation -- Dining Cryptographers Revisited -- Cryptanalysis -- Algebraic Attacks and Decomposition of Boolean Functions -- Finding Small Roots of Bivariate Integer Polynomial Equations Revisited -- New Applications -- Public Key Encryption with Keyword Search -- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data -- Algorithms and Implementation -- Merkle Tree Traversal in Log Space and Time -- Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3 -- Anonymity -- Traceable Signatures -- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme -- Anonymous Identification in Ad Hoc Groups. |
| Record Nr. | UNISA-996465405503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2005 [[electronic resource] ] : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings / / edited by Ronald Cramer
| Advances in Cryptology – EUROCRYPT 2005 [[electronic resource] ] : 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings / / edited by Ronald Cramer |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 578 p.) |
| Disciplina | 003.54 |
| Collana | Security and Cryptology |
| Soggetto topico |
Coding theory
Information theory Data encryption (Computer science) Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Coding and Information Theory Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis I -- Cryptanalysis of the Hash Functions MD4 and RIPEMD -- How to Break MD5 and Other Hash Functions -- Collisions of SHA-0 and Reduced SHA-1 -- Theory I -- Reducing Complexity Assumptions for Statistically-Hiding Commitment -- Smooth Projective Hashing and Two-Message Oblivious Transfer -- On Robust Combiners for Oblivious Transfer and Other Primitives -- Encryption I -- Efficient Identity-Based Encryption Without Random Oracles -- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM -- Signatures and Authentication -- Secure Remote Authentication Using Biometric Data -- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators -- 3-Move Undeniable Signature Scheme -- Group Signatures with Efficient Concurrent Join -- Algebra and Number Theory I -- Floating-Point LLL Revisited -- Practical Cryptography in High Dimensional Tori -- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers -- Quantum Cryptography -- Computational Indistinguishability Between Quantum States and Its Cryptographic Application -- Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes -- Secure Protocols -- Compact E-Cash -- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience -- Algebra and Number Theory II -- Differential Cryptanalysis for Multivariate Schemes -- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem -- Partial Key Exposure Attacks on RSA up to Full Size Exponents -- The RSA Group is Pseudo-Free -- Theory II -- Universally Composable Password-Based Key Exchange -- Mercurial Commitments with Applications to Zero-Knowledge Sets -- Encryption II -- Hierarchical Identity Based Encryption with Constant Size Ciphertext -- Fuzzy Identity-Based Encryption -- Cryptanalysis II -- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work -- Predicting and Distinguishing Attacks on RC4 Keystream Generator -- Related-Key Boomerang and Rectangle Attacks -- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions -- Broadcast Encryption and Traitor Tracing -- Public Traceability in Traitor Tracing Schemes -- One-Way Chain Based Broadcast Encryption Schemes. |
| Record Nr. | UNISA-996465949403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2006 [[electronic resource] ] : 25th International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings / / edited by Serge Vaudenay
| Advances in Cryptology – EUROCRYPT 2006 [[electronic resource] ] : 25th International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings / / edited by Serge Vaudenay |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 622 p.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN | 3-540-34547-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis -- Security Analysis of the Strong Diffie-Hellman Problem -- Cryptography in Theory and Practice: The Case of Encryption in IPsec -- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects -- Invited Talk I -- Alien vs. Quine, the Vanishing Circuit and Other Tales from the Industry’s Crypt -- Cryptography Meets Humans -- Hiding Secret Points Amidst Chaff -- Parallel and Concurrent Security of the HB and HB?+? Protocols -- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol -- Stream Ciphers -- QUAD: A Practical Stream Cipher with Provable Security -- How to Strengthen Pseudo-random Generators by Using Compression -- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks -- Hash Functions -- VSH, an Efficient and Provable Collision-Resistant Hash Function -- Herding Hash Functions and the Nostradamus Attack -- Oblivious Transfer -- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing -- Oblivious Transfer Is Symmetric -- Numbers and Lattices -- Symplectic Lattice Reduction and NTRU -- The Function Field Sieve in the Medium Prime Case -- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures -- Foundations -- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model -- Private Circuits II: Keeping Secrets in Tamperable Circuits -- Composition Implies Adaptive Security in Minicrypt -- Perfect Non-interactive Zero Knowledge for NP -- Invited Talk II -- Language Modeling and Encryption on Packet Switched Networks -- Block Ciphers -- A Provable-Security Treatment of the Key-Wrap Problem -- Luby-Rackoff Ciphers from Weak Round Functions? -- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs -- Cryptography Without Random Oracles -- Compact Group Signatures Without Random Oracles -- Practical Identity-Based Encryption Without Random Oracles -- Sequential Aggregate Signatures and Multisignatures Without Random Oracles -- Multiparty Computation -- Our Data, Ourselves: Privacy Via Distributed Noise Generation -- On the (Im-)Possibility of Extending Coin Toss -- Efficient Binary Conversion for Paillier Encrypted Values -- Information-Theoretic Conditions for Two-Party Secure Function Evaluation -- Cryptography for Groups -- Unclonable Group Identification -- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys -- Simplified Threshold RSA with Adaptive and Proactive Security. |
| Record Nr. | UNISA-996465571603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2006 : 25th International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings / / edited by Serge Vaudenay
| Advances in Cryptology – EUROCRYPT 2006 : 25th International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings / / edited by Serge Vaudenay |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 622 p.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN | 3-540-34547-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptanalysis -- Security Analysis of the Strong Diffie-Hellman Problem -- Cryptography in Theory and Practice: The Case of Encryption in IPsec -- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects -- Invited Talk I -- Alien vs. Quine, the Vanishing Circuit and Other Tales from the Industry’s Crypt -- Cryptography Meets Humans -- Hiding Secret Points Amidst Chaff -- Parallel and Concurrent Security of the HB and HB?+? Protocols -- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol -- Stream Ciphers -- QUAD: A Practical Stream Cipher with Provable Security -- How to Strengthen Pseudo-random Generators by Using Compression -- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks -- Hash Functions -- VSH, an Efficient and Provable Collision-Resistant Hash Function -- Herding Hash Functions and the Nostradamus Attack -- Oblivious Transfer -- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing -- Oblivious Transfer Is Symmetric -- Numbers and Lattices -- Symplectic Lattice Reduction and NTRU -- The Function Field Sieve in the Medium Prime Case -- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures -- Foundations -- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model -- Private Circuits II: Keeping Secrets in Tamperable Circuits -- Composition Implies Adaptive Security in Minicrypt -- Perfect Non-interactive Zero Knowledge for NP -- Invited Talk II -- Language Modeling and Encryption on Packet Switched Networks -- Block Ciphers -- A Provable-Security Treatment of the Key-Wrap Problem -- Luby-Rackoff Ciphers from Weak Round Functions? -- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs -- Cryptography Without Random Oracles -- Compact Group Signatures Without Random Oracles -- Practical Identity-Based Encryption Without Random Oracles -- Sequential Aggregate Signatures and Multisignatures Without Random Oracles -- Multiparty Computation -- Our Data, Ourselves: Privacy Via Distributed Noise Generation -- On the (Im-)Possibility of Extending Coin Toss -- Efficient Binary Conversion for Paillier Encrypted Values -- Information-Theoretic Conditions for Two-Party Secure Function Evaluation -- Cryptography for Groups -- Unclonable Group Identification -- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys -- Simplified Threshold RSA with Adaptive and Proactive Security. |
| Record Nr. | UNINA-9910484766303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Soggetto topico
-
Computer science—Mathematics
(3515)
- Discrete Mathematics in Computer Science (2056)
- Algorithms (1984)
- Discrete mathematics (1193)
- Computer science (1107)