Advances in cryptology - CRYPTO 2007 : 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007 ; proceedings / / edited by Alfred Menezes |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (642 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico | Computers - Access control |
ISBN |
1-280-96985-7
9786610969852 3-540-74143-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cryptanalysis I -- Practical Cryptanalysis of SFLASH -- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Secure Searching -- How Should We Solve Search Problems Privately? -- Public Key Encryption That Allows PIR Queries -- Invited Talk -- Information Security Economics – and Beyond -- Theory I -- Cryptography with Constant Input Locality -- Universally-Composable Two-Party Computation in Two Rounds -- Indistinguishability Amplification -- Lattices -- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU -- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm -- Random Oracles -- Domain Extension of Public Random Functions: Beyond the Birthday Barrier -- Random Oracles and Auxiliary Input -- Hash Functions -- Security-Amplifying Combiners for Collision-Resistant Hash Functions -- Hash Functions and the (Amplified) Boomerang Attack -- Amplifying Collision Resistance: A Complexity-Theoretic Treatment -- Theory II -- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? -- Simulatable VRFs with Applications to Multi-theorem NIZK -- Cryptography in the Multi-string Model -- Quantum Cryptography -- Secure Identification and QKD in the Bounded-Quantum-Storage Model -- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications -- Cryptanalysis II -- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach -- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 -- Encryption -- Invertible Universal Hashing and the TET Encryption Mode -- Reducing Trust in the PKG in Identity Based Cryptosystems -- Pirate Evolution: How to Make the Most of Your Traitor Keys -- Protocol Analysis -- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator -- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness -- Chernoff-Type Direct Product Theorems -- Public-Key Encryption -- Rerandomizable RCCA Encryption -- Deterministic and Efficiently Searchable Encryption -- Secure Hybrid Encryption from Weakened Key Encapsulation -- Multi-party Computation -- Scalable and Unconditionally Secure Multiparty Computation -- On Secure Multi-party Computation in Black-Box Groups -- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. |
Record Nr. | UNISA-996465500503316 |
Berlin, Germany : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in cryptology - CRYPTO 2007 : 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007 ; proceedings / / edited by Alfred Menezes |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (642 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico | Computers - Access control |
ISBN |
1-280-96985-7
9786610969852 3-540-74143-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cryptanalysis I -- Practical Cryptanalysis of SFLASH -- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Secure Searching -- How Should We Solve Search Problems Privately? -- Public Key Encryption That Allows PIR Queries -- Invited Talk -- Information Security Economics – and Beyond -- Theory I -- Cryptography with Constant Input Locality -- Universally-Composable Two-Party Computation in Two Rounds -- Indistinguishability Amplification -- Lattices -- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU -- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm -- Random Oracles -- Domain Extension of Public Random Functions: Beyond the Birthday Barrier -- Random Oracles and Auxiliary Input -- Hash Functions -- Security-Amplifying Combiners for Collision-Resistant Hash Functions -- Hash Functions and the (Amplified) Boomerang Attack -- Amplifying Collision Resistance: A Complexity-Theoretic Treatment -- Theory II -- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? -- Simulatable VRFs with Applications to Multi-theorem NIZK -- Cryptography in the Multi-string Model -- Quantum Cryptography -- Secure Identification and QKD in the Bounded-Quantum-Storage Model -- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications -- Cryptanalysis II -- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach -- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 -- Encryption -- Invertible Universal Hashing and the TET Encryption Mode -- Reducing Trust in the PKG in Identity Based Cryptosystems -- Pirate Evolution: How to Make the Most of Your Traitor Keys -- Protocol Analysis -- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator -- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness -- Chernoff-Type Direct Product Theorems -- Public-Key Encryption -- Rerandomizable RCCA Encryption -- Deterministic and Efficiently Searchable Encryption -- Secure Hybrid Encryption from Weakened Key Encapsulation -- Multi-party Computation -- Scalable and Unconditionally Secure Multiparty Computation -- On Secure Multi-party Computation in Black-Box Groups -- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. |
Record Nr. | UNINA-9910484581503321 |
Berlin, Germany : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - CRYPTO 2008 : 28th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2008, proceedings / / edited by David Wagner |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [2008] |
Descrizione fisica | 1 online resource (XIV, 594 p.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Computers - Access control
Cryptography |
ISBN | 3-540-85174-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Random Oracles -- The Random Oracle Model and the Ideal Cipher Model Are Equivalent -- Programmable Hash Functions and Their Applications -- Applications -- One-Time Programs -- Adaptive One-Way Functions and Applications -- Public-Key Crypto I -- Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys -- Improved Bounds on Security Reductions for Discrete Log Based Signatures -- Circular-Secure Encryption from Decision Diffie-Hellman -- Public-Key Locally-Decodable Codes -- Hash Functions I -- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms -- Cryptanalysis of the GOST Hash Function -- Preimages for Reduced SHA-0 and SHA-1 -- Cryptanalysis I -- On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme -- Bug Attacks -- Multiparty Computation I -- Scalable Multiparty Computation with Nearly Optimal Work and Resilience -- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations -- Cryptanalysis II -- Cryptanalysis of MinRank -- New State Recovery Attack on RC4 -- Public-Key Crypto II -- Dynamic Threshold Public-Key Encryption -- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles -- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles -- Communication Complexity in Algebraic Two-Party Protocols -- Hash Functions II -- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions -- Compression from Collisions, or Why CRHF Combiners Have a Long Output -- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers -- Distributed Private Data Analysis: Simultaneously Solving How and What -- New Efficient Attacks on Statistical Disclosure Control Mechanisms -- Multiparty Computation II -- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries -- Collusion-Free Protocols in the Mediated Model -- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs -- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems -- A Framework for Efficient and Composable Oblivious Transfer -- Founding Cryptography on Oblivious Transfer – Efficiently. |
Record Nr. | UNISA-996465498603316 |
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - CRYPTO 2008 : 28th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2008, proceedings / / edited by David Wagner |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [2008] |
Descrizione fisica | 1 online resource (XIV, 594 p.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Computers - Access control
Cryptography |
ISBN | 3-540-85174-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Random Oracles -- The Random Oracle Model and the Ideal Cipher Model Are Equivalent -- Programmable Hash Functions and Their Applications -- Applications -- One-Time Programs -- Adaptive One-Way Functions and Applications -- Public-Key Crypto I -- Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys -- Improved Bounds on Security Reductions for Discrete Log Based Signatures -- Circular-Secure Encryption from Decision Diffie-Hellman -- Public-Key Locally-Decodable Codes -- Hash Functions I -- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms -- Cryptanalysis of the GOST Hash Function -- Preimages for Reduced SHA-0 and SHA-1 -- Cryptanalysis I -- On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme -- Bug Attacks -- Multiparty Computation I -- Scalable Multiparty Computation with Nearly Optimal Work and Resilience -- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations -- Cryptanalysis II -- Cryptanalysis of MinRank -- New State Recovery Attack on RC4 -- Public-Key Crypto II -- Dynamic Threshold Public-Key Encryption -- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles -- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles -- Communication Complexity in Algebraic Two-Party Protocols -- Hash Functions II -- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions -- Compression from Collisions, or Why CRHF Combiners Have a Long Output -- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers -- Distributed Private Data Analysis: Simultaneously Solving How and What -- New Efficient Attacks on Statistical Disclosure Control Mechanisms -- Multiparty Computation II -- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries -- Collusion-Free Protocols in the Mediated Model -- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs -- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems -- A Framework for Efficient and Composable Oblivious Transfer -- Founding Cryptography on Oblivious Transfer – Efficiently. |
Record Nr. | UNINA-9910483008503321 |
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in cryptology - EUROCRYPT 2007 : 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, proceedings / / edited by Moni Naor |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (602 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Cryptography
Computers - Access control Data transmission systems - Security measures |
ISBN |
1-280-94372-6
9786610943722 3-540-72540-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities -- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist -- The Collision Intractability of MDC-2 in the Ideal-Cipher Model -- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries -- Revisiting the Efficiency of Malicious Two-Party Computation -- Efficient Two-Party Secure Computation on Committed Inputs -- Universally Composable Multi-party Computation Using Tamper-Proof Hardware -- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model -- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability -- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility -- Zero Knowledge and Soundness Are Symmetric -- Mesh Signatures -- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks -- Batch Verification of Short Signatures -- Cryptanalysis of SFLASH with Slightly Modified Parameters -- Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy -- Secure Computation from Random Error Correcting Codes -- Round-Efficient Secure Computation in Point-to-Point Networks -- Atomic Secure Multi-party Multiplication with Low Communication -- Cryptanalysis of the Sidelnikov Cryptosystem -- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables -- An L (1/3?+??) Algorithm for the Discrete Logarithm Problem for Low Degree Curves -- General Ad Hoc Encryption from Exponent Inversion IBE -- Non-interactive Proofs for Integer Multiplication -- Ate Pairing on Hyperelliptic Curves -- Ideal Multipartite Secret Sharing Schemes -- Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit -- Divisible E-Cash Systems Can Be Truly Anonymous -- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security -- Range Extension for Weak PRFs; The Good, the Bad, and the Ugly -- Feistel Networks Made Public, and Applications -- Oblivious-Transfer Amplification -- Simulatable Adaptive Oblivious Transfer. |
Record Nr. | UNINA-9910483707703321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in cryptology - EUROCRYPT 2007 : 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, proceedings / / edited by Moni Naor |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (602 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Cryptography
Computers - Access control Data transmission systems - Security measures |
ISBN |
1-280-94372-6
9786610943722 3-540-72540-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities -- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist -- The Collision Intractability of MDC-2 in the Ideal-Cipher Model -- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries -- Revisiting the Efficiency of Malicious Two-Party Computation -- Efficient Two-Party Secure Computation on Committed Inputs -- Universally Composable Multi-party Computation Using Tamper-Proof Hardware -- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model -- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability -- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility -- Zero Knowledge and Soundness Are Symmetric -- Mesh Signatures -- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks -- Batch Verification of Short Signatures -- Cryptanalysis of SFLASH with Slightly Modified Parameters -- Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy -- Secure Computation from Random Error Correcting Codes -- Round-Efficient Secure Computation in Point-to-Point Networks -- Atomic Secure Multi-party Multiplication with Low Communication -- Cryptanalysis of the Sidelnikov Cryptosystem -- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables -- An L (1/3?+??) Algorithm for the Discrete Logarithm Problem for Low Degree Curves -- General Ad Hoc Encryption from Exponent Inversion IBE -- Non-interactive Proofs for Integer Multiplication -- Ate Pairing on Hyperelliptic Curves -- Ideal Multipartite Secret Sharing Schemes -- Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit -- Divisible E-Cash Systems Can Be Truly Anonymous -- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security -- Range Extension for Weak PRFs; The Good, the Bad, and the Ugly -- Feistel Networks Made Public, and Applications -- Oblivious-Transfer Amplification -- Simulatable Adaptive Oblivious Transfer. |
Record Nr. | UNISA-996465519903316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - EUROCRYPT 2023 . Part V : 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings / / Carmit Hazay and Martijn Stam, editors |
Edizione | [First edition.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (XVII, 786 p. 118 illus., 27 illus. in color.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science Series |
Soggetto topico |
Computer security
Computers - Access control Cryptography Data encryption (Computer science) |
ISBN | 3-031-30589-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996525669003316 |
Cham, Switzerland : , : Springer, , [2023] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - EUROCRYPT 2023 . Part V : 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings / / Carmit Hazay and Martijn Stam, editors |
Edizione | [First edition.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (XVII, 786 p. 118 illus., 27 illus. in color.) |
Disciplina | 005.82 |
Collana | Lecture Notes in Computer Science Series |
Soggetto topico |
Computer security
Computers - Access control Cryptography Data encryption (Computer science) |
ISBN | 3-031-30589-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910698654003321 |
Cham, Switzerland : , : Springer, , [2023] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in cryptology -- EUROCRYPT 2008 : 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008 : proceedings / / Nigel Smart (ed.) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
Descrizione fisica | 1 online resource (XIII, 564 p.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data transmission systems - Security measures
Cryptography Computers - Access control |
ISBN | 3-540-78967-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Practical Attack on KeeLoq -- Key Recovery on Hidden Monomial Multivariate Schemes -- Predicting Lattice Reduction -- Efficient Sequential Aggregate Signed Data -- Proving Tight Security for Rabin-Williams Signatures -- Threshold RSA for Dynamic and Ad-Hoc Groups -- Towards Key-Dependent Message Security in the Standard Model -- The Twin Diffie-Hellman Problem and Applications -- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products -- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves -- On the Indifferentiability of the Sponge Construction -- A New Mode of Operation for Block Ciphers and Length-Preserving MACs -- Security/Efficiency Tradeoffs for Permutation-Based Hashing -- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Collisions for the LPS Expander Graph Hash Function -- Second Preimage Attacks on Dithered Hash Functions -- Efficient Two Party and Multi Party Computation Against Covert Adversaries -- Almost-Everywhere Secure Computation -- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme -- Protocols and Lower Bounds for Failure Localization in the Internet -- : Increasing the Security and Efficiency of -- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle -- Precise Concurrent Zero Knowledge -- Efficient Non-interactive Proof Systems for Bilinear Groups -- Zero-Knowledge Sets with Short Proofs -- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves -- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors -- Obfuscating Point Functions with Multibit Output -- Isolated Proofs of Knowledge and Isolated Zero Knowledge -- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware -- New Constructions for UC Secure Computation Using Tamper-Proof Hardware. |
Record Nr. | UNINA-9910483618603321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in cryptology -- EUROCRYPT 2008 : 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008 : proceedings / / Nigel Smart (ed.) |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
Descrizione fisica | 1 online resource (XIII, 564 p.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data transmission systems - Security measures
Cryptography Computers - Access control |
ISBN | 3-540-78967-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Practical Attack on KeeLoq -- Key Recovery on Hidden Monomial Multivariate Schemes -- Predicting Lattice Reduction -- Efficient Sequential Aggregate Signed Data -- Proving Tight Security for Rabin-Williams Signatures -- Threshold RSA for Dynamic and Ad-Hoc Groups -- Towards Key-Dependent Message Security in the Standard Model -- The Twin Diffie-Hellman Problem and Applications -- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products -- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves -- On the Indifferentiability of the Sponge Construction -- A New Mode of Operation for Block Ciphers and Length-Preserving MACs -- Security/Efficiency Tradeoffs for Permutation-Based Hashing -- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Collisions for the LPS Expander Graph Hash Function -- Second Preimage Attacks on Dithered Hash Functions -- Efficient Two Party and Multi Party Computation Against Covert Adversaries -- Almost-Everywhere Secure Computation -- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme -- Protocols and Lower Bounds for Failure Localization in the Internet -- : Increasing the Security and Efficiency of -- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle -- Precise Concurrent Zero Knowledge -- Efficient Non-interactive Proof Systems for Bilinear Groups -- Zero-Knowledge Sets with Short Proofs -- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves -- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors -- Obfuscating Point Functions with Multibit Output -- Isolated Proofs of Knowledge and Isolated Zero Knowledge -- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware -- New Constructions for UC Secure Computation Using Tamper-Proof Hardware. |
Record Nr. | UNISA-996465495903316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|