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.
Tools for Practical Software Verification [[electronic resource] ] : International Summer School, LASER 2011, Elba Island, Italy, Revised Tutorial Lectures / / edited by Bertrand Meyer, Martin Nordio
| Tools for Practical Software Verification [[electronic resource] ] : International Summer School, LASER 2011, Elba Island, Italy, Revised Tutorial Lectures / / edited by Bertrand Meyer, Martin Nordio |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (VIII, 183 p. 31 illus.) |
| Disciplina | 005.1/4 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer logic Computer programming Programming languages (Electronic computers) Mathematical logic Management information systems Computer science Software Engineering Logics and Meanings of Programs Programming Techniques Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Management of Computing and Information Systems |
| ISBN | 3-642-35746-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Model Checking and the State Explosion Problem -- From Program to Logic: An Introduction -- Introduction to the Coq Proof-Assistant for Practical Software Verification -- Advanced Theorem Proving Techniques in PVS and Applications -- Automatic Verification of Advanced Object-Oriented Features: -- The AutoProof Approach -- Using Dafny, an Automatic Program Verifier. |
| Record Nr. | UNISA-996466037003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology - CT-RSA 2001 [[electronic resource] ] : The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings / / edited by David Naccache
| Topics in Cryptology - CT-RSA 2001 [[electronic resource] ] : The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings / / edited by David Naccache |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 005.8/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Operating systems (Computers) Algorithms Computer communication systems Management information systems Computer science Cryptology Mathematics of Computing Operating Systems Algorithm Analysis and Problem Complexity Computer Communication Networks Management of Computing and Information Systems |
| ISBN | 3-540-45353-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New Cryptosystems -- Faster Generation of NICE-Schnorr-Type Signatures -- New Key Agreement Protocols in Braid Group Cryptography -- RSA -- Improving SSL Handshake Performance via Batching -- From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes -- An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits -- Symmetric Cryptography -- On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys -- Analysis of SHA-1 in Encryption Mode -- Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays -- Gambling and Lotteries -- Fair e-Lotteries and e-Casinos -- Secure Mobile Gambling -- Reductions, Constructions and Security Proofs -- Formal Security Proofs for a Signature Scheme with Partial Message Recovery -- The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES -- REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform -- Flaws and Attacks -- Security Weaknesses in Bluetooth -- Distinguishing Exponent Digits by Observing Modular Subtractions -- On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC -- Implementation -- Modular Exponentiation on Fine-Grained FPGA -- Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip -- Software Implementation of the NIST Elliptic Curves Over Prime Fields -- Multivariate Cryptography -- The Security of Hidden Field Equations (HFE) -- QUARTZ, 128-Bit Long Digital Signatures -- FLASH, a Fast Multivariate Signature Algorithm -- Number Theoretic Problems -- Analysis of the Weil Descent Attack of Gaudry, Hess and Smart -- Using Fewer Qubits in Shor’s Factorization Algorithm via Simultaneous Diophantine Approximation -- Passwords and Credentials -- Relying Party Credentials Framework -- Password Authentication Using Multiple Servers -- More Efficient Password-Authenticated Key Exchange -- Protocols I -- Improved Boneh-Shaw Content Fingerprinting -- Efficient Asymmetric Public-Key Traitor Tracing Without Trusted Agents -- Targeted Advertising ... and Privacy Too -- Protocols II -- Uncheatable Distributed Computations -- Forward-Secure Threshold Signature Schemes -- A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. |
| Record Nr. | UNISA-996465716903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology - CT-RSA 2001 [[electronic resource] ] : The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings / / edited by David Naccache
| Topics in Cryptology - CT-RSA 2001 [[electronic resource] ] : The Cryptographer's Track at RSA Conference 2001 San Francisco, CA, USA, April 8-12, 2001 Proceedings / / edited by David Naccache |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 480 p.) |
| Disciplina | 005.8/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Operating systems (Computers) Algorithms Computer communication systems Management information systems Computer science Cryptology Mathematics of Computing Operating Systems Algorithm Analysis and Problem Complexity Computer Communication Networks Management of Computing and Information Systems |
| ISBN | 3-540-45353-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New Cryptosystems -- Faster Generation of NICE-Schnorr-Type Signatures -- New Key Agreement Protocols in Braid Group Cryptography -- RSA -- Improving SSL Handshake Performance via Batching -- From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes -- An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits -- Symmetric Cryptography -- On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys -- Analysis of SHA-1 in Encryption Mode -- Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays -- Gambling and Lotteries -- Fair e-Lotteries and e-Casinos -- Secure Mobile Gambling -- Reductions, Constructions and Security Proofs -- Formal Security Proofs for a Signature Scheme with Partial Message Recovery -- The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES -- REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform -- Flaws and Attacks -- Security Weaknesses in Bluetooth -- Distinguishing Exponent Digits by Observing Modular Subtractions -- On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC -- Implementation -- Modular Exponentiation on Fine-Grained FPGA -- Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip -- Software Implementation of the NIST Elliptic Curves Over Prime Fields -- Multivariate Cryptography -- The Security of Hidden Field Equations (HFE) -- QUARTZ, 128-Bit Long Digital Signatures -- FLASH, a Fast Multivariate Signature Algorithm -- Number Theoretic Problems -- Analysis of the Weil Descent Attack of Gaudry, Hess and Smart -- Using Fewer Qubits in Shor’s Factorization Algorithm via Simultaneous Diophantine Approximation -- Passwords and Credentials -- Relying Party Credentials Framework -- Password Authentication Using Multiple Servers -- More Efficient Password-Authenticated Key Exchange -- Protocols I -- Improved Boneh-Shaw Content Fingerprinting -- Efficient Asymmetric Public-Key Traitor Tracing Without Trusted Agents -- Targeted Advertising ... and Privacy Too -- Protocols II -- Uncheatable Distributed Computations -- Forward-Secure Threshold Signature Schemes -- A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. |
| Record Nr. | UNINA-9910767541903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Topics in Cryptology - CT-RSA 2002 [[electronic resource] ] : The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings / / edited by Bart Preneel
| Topics in Cryptology - CT-RSA 2002 [[electronic resource] ] : The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings / / edited by Bart Preneel |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 318 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computers Operating systems (Computers) Computer science—Mathematics Management information systems Computer science Algorithms Cryptology Theory of Computation Operating Systems Discrete Mathematics in Computer Science Management of Computing and Information Systems Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45760-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Public Key Cryptography -- On Hash Function Firewalls in Signature Schemes -- Observability Analysis - Detecting When Improved Cryptosystems Fail - -- Efficient Hardware Implementations -- Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli -- Montgomery in Practice: How to Do It More Efficiently in Hardware -- MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis -- An ASIC Implementation of the AES SBoxes -- Public Key Cryptography: Theory -- On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function -- The Representation Problem Based on Factoring -- Symmetric Ciphers -- Ciphers with Arbitrary Finite Domains -- Known Plaintext Correlation Attack against RC5 -- E-Commerce and Applications -- Micropayments Revisited -- Proprietary Certificates -- Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption -- Digital Signatures -- RSA-Based Undeniable Signatures for General Moduli -- Co-operatively Formed Group Signatures -- Transitive Signature Schemes -- Homomorphic Signature Schemes -- Public Key Encryption -- GEM: A Generic Chosen-Ciphertext Secure Encryption Method -- Securing “Encryption + Proof of Knowledge” in the Random Oracle Model -- Discrete Logarithm -- Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture -- Secure Key-Evolving Protocols for Discrete Logarithm Schemes. |
| Record Nr. | UNINA-9910143916803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Topics in Cryptology - CT-RSA 2002 [[electronic resource] ] : The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings / / edited by Bart Preneel
| Topics in Cryptology - CT-RSA 2002 [[electronic resource] ] : The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings / / edited by Bart Preneel |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 318 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computers Operating systems (Computers) Computer science—Mathematics Management information systems Computer science Algorithms Cryptology Theory of Computation Operating Systems Discrete Mathematics in Computer Science Management of Computing and Information Systems Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45760-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Public Key Cryptography -- On Hash Function Firewalls in Signature Schemes -- Observability Analysis - Detecting When Improved Cryptosystems Fail - -- Efficient Hardware Implementations -- Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli -- Montgomery in Practice: How to Do It More Efficiently in Hardware -- MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis -- An ASIC Implementation of the AES SBoxes -- Public Key Cryptography: Theory -- On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function -- The Representation Problem Based on Factoring -- Symmetric Ciphers -- Ciphers with Arbitrary Finite Domains -- Known Plaintext Correlation Attack against RC5 -- E-Commerce and Applications -- Micropayments Revisited -- Proprietary Certificates -- Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption -- Digital Signatures -- RSA-Based Undeniable Signatures for General Moduli -- Co-operatively Formed Group Signatures -- Transitive Signature Schemes -- Homomorphic Signature Schemes -- Public Key Encryption -- GEM: A Generic Chosen-Ciphertext Secure Encryption Method -- Securing “Encryption + Proof of Knowledge” in the Random Oracle Model -- Discrete Logarithm -- Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture -- Secure Key-Evolving Protocols for Discrete Logarithm Schemes. |
| Record Nr. | UNISA-996465552803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology -- CT-RSA 2003 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings / / edited by Marc Joye
| Topics in Cryptology -- CT-RSA 2003 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings / / edited by Marc Joye |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 424 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Computer science—Mathematics Computers and civilization Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Discrete Mathematics in Computer Science Computers and Society Management of Computing and Information Systems |
| ISBN | 3-540-36563-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Key Self-protection -- Forward-Security in Private-Key Cryptography -- Intrusion-Resilient Public-Key Encryption -- Message Authentication -- TMAC: Two-Key CBC MAC -- Montgomery Prime Hashing for Message Authentication -- Digital Signatures -- An Analysis of Proxy Signatures: Is a Secure Channel Necessary? -- Invisibility and Anonymity of Undeniable and Confirmer Signatures -- Pairing Based Cryptography -- A Secure Signature Scheme from Bilinear Maps -- Access Control Using Pairing Based Cryptography -- Multivariate and Lattice Problems -- NTRUSign: Digital Signatures Using the NTRU Lattice -- About the XL Algorithm over GF(2) -- Cryptographic Architectures -- Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications -- Hardware Performance Characterization of Block Cipher Structures -- New RSA-based Cryptosystems -- Simple Identity-Based Cryptography with Mediated RSA -- Two Birds One Stone: Signcryption Using RSA -- Invited Talk I -- Cryptography after the Bubble: How to Make an Impact on the World -- Chosen-Ciphertext Security -- Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption -- Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes -- Broadcast Encryption and PRF Sharing -- Fault Tolerant and Distributed Broadcast Encryption -- Shared Generation of Pseudo-Random Functions with Cumulative Maps -- Authentication Structures -- Authenticated Data Structures for Graph and Geometric Searching -- Fractal Merkle Tree Representation and Traversal -- Invited Talk II -- RSA Shortcuts -- Elliptic Curves and Pairings -- The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks -- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation -- Threshold Cryptography -- Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures -- Secure Applications of Pedersen’s Distributed Key Generation Protocol -- Implementation Issues -- Seeing through Mist Given a Small Fraction of an RSA Private Key -- Simple Backdoors for RSA Key Generation. |
| Record Nr. | UNINA-9910143890003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Topics in Cryptology -- CT-RSA 2003 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings / / edited by Marc Joye
| Topics in Cryptology -- CT-RSA 2003 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings / / edited by Marc Joye |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 424 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Computer science—Mathematics Computers and civilization Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Discrete Mathematics in Computer Science Computers and Society Management of Computing and Information Systems |
| ISBN | 3-540-36563-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Key Self-protection -- Forward-Security in Private-Key Cryptography -- Intrusion-Resilient Public-Key Encryption -- Message Authentication -- TMAC: Two-Key CBC MAC -- Montgomery Prime Hashing for Message Authentication -- Digital Signatures -- An Analysis of Proxy Signatures: Is a Secure Channel Necessary? -- Invisibility and Anonymity of Undeniable and Confirmer Signatures -- Pairing Based Cryptography -- A Secure Signature Scheme from Bilinear Maps -- Access Control Using Pairing Based Cryptography -- Multivariate and Lattice Problems -- NTRUSign: Digital Signatures Using the NTRU Lattice -- About the XL Algorithm over GF(2) -- Cryptographic Architectures -- Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications -- Hardware Performance Characterization of Block Cipher Structures -- New RSA-based Cryptosystems -- Simple Identity-Based Cryptography with Mediated RSA -- Two Birds One Stone: Signcryption Using RSA -- Invited Talk I -- Cryptography after the Bubble: How to Make an Impact on the World -- Chosen-Ciphertext Security -- Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption -- Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes -- Broadcast Encryption and PRF Sharing -- Fault Tolerant and Distributed Broadcast Encryption -- Shared Generation of Pseudo-Random Functions with Cumulative Maps -- Authentication Structures -- Authenticated Data Structures for Graph and Geometric Searching -- Fractal Merkle Tree Representation and Traversal -- Invited Talk II -- RSA Shortcuts -- Elliptic Curves and Pairings -- The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks -- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation -- Threshold Cryptography -- Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures -- Secure Applications of Pedersen’s Distributed Key Generation Protocol -- Implementation Issues -- Seeing through Mist Given a Small Fraction of an RSA Private Key -- Simple Backdoors for RSA Key Generation. |
| Record Nr. | UNISA-996465765603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology -- CT-RSA 2004 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / / edited by Tatsuaki Okamoto
| Topics in Cryptology -- CT-RSA 2004 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / / edited by Tatsuaki Okamoto |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 392 p.) |
| Disciplina | 005.8 |
| 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-30687-4
9786610306879 3-540-24660-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Symmetric Encryption -- Online Encryption Schemes: New Security Notions and Constructions -- Related-Key Attacks on Triple-DES and DESX Variants -- Design of AES Based on Dual Cipher and Composite Field -- Periodic Properties of Counter Assisted Stream Ciphers -- A Fast Correlation Attack via Unequal Error Correcting LDPC Codes -- Aymmetric Encryption -- k-Resilient Identity-Based Encryption in the Standard Model -- A Generic Construction for Intrusion-Resilient Public-Key Encryption -- Digital Signatures -- A Certificate-Based Signature Scheme -- Identity Based Undeniable Signatures -- Compressing Rabin Signatures -- Protocols -- A Key Recovery System as Secure as Factoring -- Server Assisted Signatures Revisited -- Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95 -- Universal Re-encryption for Mixnets -- Bit String Commitment Reductions with a Non-zero Rate -- Improving Robustness of PGP Keyrings by Conflict Detection -- Side-Channel Attacks -- Issues of Security with the Oswald-Aigner Exponentiation Algorithm -- Hardware Countermeasures against DPA – A Statistical Analysis of Their Effectiveness -- Self-Randomized Exponentiation Algorithms -- Hardwares -- Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems -- High-Speed Modular Multiplication -- Yet Another Sieving Device -- Mode of Operations -- A Parallelizable Enciphering Mode -- Padding Oracle Attacks on the ISO CBC Mode Encryption Standard -- Hash and Hash Chains -- A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512 -- Fast Verification of Hash Chains -- Visual Cryptography -- Almost Ideal Contrast Visual Cryptography with Reversing -- Ellictic Curve Cryptosystems -- Weak Fields for ECC. |
| Record Nr. | UNINA-9910144206803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Topics in Cryptology -- CT-RSA 2004 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / / edited by Tatsuaki Okamoto
| Topics in Cryptology -- CT-RSA 2004 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / / edited by Tatsuaki Okamoto |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 392 p.) |
| Disciplina | 005.8 |
| 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-30687-4
9786610306879 3-540-24660-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Symmetric Encryption -- Online Encryption Schemes: New Security Notions and Constructions -- Related-Key Attacks on Triple-DES and DESX Variants -- Design of AES Based on Dual Cipher and Composite Field -- Periodic Properties of Counter Assisted Stream Ciphers -- A Fast Correlation Attack via Unequal Error Correcting LDPC Codes -- Aymmetric Encryption -- k-Resilient Identity-Based Encryption in the Standard Model -- A Generic Construction for Intrusion-Resilient Public-Key Encryption -- Digital Signatures -- A Certificate-Based Signature Scheme -- Identity Based Undeniable Signatures -- Compressing Rabin Signatures -- Protocols -- A Key Recovery System as Secure as Factoring -- Server Assisted Signatures Revisited -- Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95 -- Universal Re-encryption for Mixnets -- Bit String Commitment Reductions with a Non-zero Rate -- Improving Robustness of PGP Keyrings by Conflict Detection -- Side-Channel Attacks -- Issues of Security with the Oswald-Aigner Exponentiation Algorithm -- Hardware Countermeasures against DPA – A Statistical Analysis of Their Effectiveness -- Self-Randomized Exponentiation Algorithms -- Hardwares -- Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems -- High-Speed Modular Multiplication -- Yet Another Sieving Device -- Mode of Operations -- A Parallelizable Enciphering Mode -- Padding Oracle Attacks on the ISO CBC Mode Encryption Standard -- Hash and Hash Chains -- A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512 -- Fast Verification of Hash Chains -- Visual Cryptography -- Almost Ideal Contrast Visual Cryptography with Reversing -- Ellictic Curve Cryptosystems -- Weak Fields for ECC. |
| Record Nr. | UNISA-996465415403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology -- CT-RSA 2005 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2005, San Francisco, CA, USA, February 14-18, 2005, Proceedings / / edited by Alfred John Menezes
| Topics in Cryptology -- CT-RSA 2005 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2005, San Francisco, CA, USA, February 14-18, 2005, Proceedings / / edited by Alfred John Menezes |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (X, 390 p.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Operating systems (Computers) Management information systems Computer science Algorithms Computer communication systems Cryptology Discrete Mathematics in Computer Science Operating Systems Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computer Communication Networks |
| ISBN | 3-540-30574-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sub-linear Queries Statistical Databases: Privacy with Power -- Malicious Cryptography: Kleptographic Aspects -- Cryptanalysis -- Resistance of SNOW 2.0 Against Algebraic Attacks -- A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes -- Hold Your Sessions: An Attack on Java Session-Id Generation -- Update on SHA-1 -- A Fast Correlation Attack on the Shrinking Generator -- Public-Key Encryption -- Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption -- A Generic Conversion with Optimal Redundancy -- Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3 -- Signature Schemes -- Foundations of Group Signatures: The Case of Dynamic Groups -- Time-Selective Convertible Undeniable Signatures -- Design Principles -- On Tolerant Cryptographic Constructions -- Password-Based Protocols -- Simple Password-Based Encrypted Key Exchange Protocols -- Hard Bits of the Discrete Log with Applications to Password Authentication -- Proofs for Two-Server Password Authentication -- Design and Analysis of Password-Based Key Derivation Functions -- Pairings -- A New Two-Party Identity-Based Authenticated Key Agreement -- Accumulators from Bilinear Pairings and Applications -- Computing the Tate Pairing -- Fast and Proven Secure Blind Identity-Based Signcryption from Pairings -- Efficient and Secure Implementation -- A Systematic Evaluation of Compact Hardware Implementations for the Rijndael S-Box -- CryptoGraphics: Secret Key Cryptography Using Graphics Cards -- Side-Channel Leakage of Masked CMOS Gates -- New Minimal Weight Representations for Left-to-Right Window Methods. |
| Record Nr. | UNINA-9910484960503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
