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 -- CRYPTO 2012 [[electronic resource] ] : 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012, Proceedings / / edited by Reihaneh Safavi-Naini, Ran Canetti
| Advances in Cryptology -- CRYPTO 2012 [[electronic resource] ] : 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012, Proceedings / / edited by Reihaneh Safavi-Naini, Ran Canetti |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XV, 888 p. 103 illus.) |
| Disciplina | 005.8/2 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Management information systems Computer science Computer communication systems Computer security Computers and civilization Computer science—Mathematics Cryptology Management of Computing and Information Systems Computer Communication Networks Systems and Data Security Computers and Society Discrete Mathematics in Computer Science |
| Soggetto genere / forma | Conference proceedings. |
| ISBN | 3-642-32009-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Symmetric Cryptosystems -- An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.- Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.- Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. |
| Record Nr. | UNISA-996465545803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2013 [[electronic resource] ] : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I / / edited by Ran Canetti, Juan A. Garay
| Advances in Cryptology – CRYPTO 2013 [[electronic resource] ] : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I / / edited by Ran Canetti, Juan A. Garay |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 590 p. 83 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Computer science Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Science, general |
| ISBN | 3-642-40041-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattices and FHE -- Foundations of Hardness -- Cryptanalysis -- New Directions -- Leakage Resilience -- Symmetric Encryption and PRFs -- Key Exchange -- Multi Linear Maps -- Ideal Ciphers. |
| Record Nr. | UNISA-996465940303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2013 [[electronic resource] ] : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II / / edited by Ran Canetti, Juan A. Garay
| Advances in Cryptology – CRYPTO 2013 [[electronic resource] ] : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II / / edited by Ran Canetti, Juan A. Garay |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 558 p. 31 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Computer science Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Science, general |
| ISBN | 3-642-40084-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Implementation-Oriented Protocols -- Number-Theoretic Hardness -- MPC-Foundations -- Codes and Secret Sharing -- Signatures and Authentication -- Quantum Security -- New Primitives -- Functional Encryption. |
| Record Nr. | UNISA-996465959203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2013 : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II / / edited by Ran Canetti, Juan A. Garay
| Advances in Cryptology – CRYPTO 2013 : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II / / edited by Ran Canetti, Juan A. Garay |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 558 p. 31 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Computer science Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Science, general |
| ISBN | 3-642-40084-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Implementation-Oriented Protocols -- Number-Theoretic Hardness -- MPC-Foundations -- Codes and Secret Sharing -- Signatures and Authentication -- Quantum Security -- New Primitives -- Functional Encryption. |
| Record Nr. | UNINA-9910483163403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – CRYPTO 2013 : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I / / edited by Ran Canetti, Juan A. Garay
| Advances in Cryptology – CRYPTO 2013 : 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I / / edited by Ran Canetti, Juan A. Garay |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 590 p. 83 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Computer science Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Science, general |
| ISBN | 3-642-40041-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lattices and FHE -- Foundations of Hardness -- Cryptanalysis -- New Directions -- Leakage Resilience -- Symmetric Encryption and PRFs -- Key Exchange -- Multi Linear Maps -- Ideal Ciphers. |
| Record Nr. | UNINA-9910483213803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of cryptography : fifth theory of cryptography conference, TCC 2008, New York, USA, March 19-21, 2008, proceedings. / / Ran Canetti (ed)
| Theory of cryptography : fifth theory of cryptography conference, TCC 2008, New York, USA, March 19-21, 2008, proceedings. / / Ran Canetti (ed) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 645 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Cryptography
Computer security |
| ISBN | 3-540-78524-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Technical Session 1 -- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency -- On Seed-Incompressible Functions -- Technical Session 2 -- Asymptotically Efficient Lattice-Based Digital Signatures -- Basing Weak Public-Key Cryptography on Strong One-Way Functions -- Technical Session 3 -- Which Languages Have 4-Round Zero-Knowledge Proofs? -- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge -- General Properties of Quantum Zero-Knowledge Proofs -- Technical Session 4 -- The Layered Games Framework for Specifications and Analysis of Security Protocols -- Universally Composable Multi-party Computation with an Unreliable Common Reference String -- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries -- Fast Private Norm Estimation and Heavy Hitters -- Technical Session 5 -- Matroids Can Be Far from Ideal Secret Sharing -- Perfectly-Secure MPC with Linear Communication Complexity -- MPC vs. SFE: Perfect Security in a Unified Corruption Model -- Invited Talk -- Bridging Game Theory and Cryptography: Recent Results and Future Directions -- Technical Session 6 -- Verifiably Secure Devices -- Lower Bounds on Implementing Robust and Resilient Mediators -- Cryptography and Game Theory: Designing Protocols for Exchanging Information -- Technical Session 7 -- Equivocal Blind Signatures and Adaptive UC-Security -- P-signatures and Noninteractive Anonymous Credentials -- Technical Session 8 -- Multi-property Preserving Combiners for Hash Functions -- OT-Combiners via Secure Computation -- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way -- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One -- Technical Session 9 -- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval -- Randomness Extraction Via ?-Biased Masking in the Presence of a Quantum Attacker -- Technical Session 10 -- An Equivalence Between Zero Knowledge and Commitments -- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model -- Technical Session 11 -- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization -- On Constant-Round Concurrent Zero-Knowledge -- Technical Session 12 -- Concurrent Non-malleable Commitments from Any One-Way Function -- Faster and Shorter Password-Authenticated Key Exchange -- Technical Session 13 -- Saving Private Randomness in One-Way Functions and Pseudorandom Generators -- Degradation and Amplification of Computational Hardness. |
| Record Nr. | UNINA-9910482979803321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of cryptography : fifth theory of cryptography conference, TCC 2008, New York, USA, March 19-21, 2008, proceedings. / / Ran Canetti (ed)
| Theory of cryptography : fifth theory of cryptography conference, TCC 2008, New York, USA, March 19-21, 2008, proceedings. / / Ran Canetti (ed) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 645 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Cryptography
Computer security |
| ISBN | 3-540-78524-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Technical Session 1 -- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency -- On Seed-Incompressible Functions -- Technical Session 2 -- Asymptotically Efficient Lattice-Based Digital Signatures -- Basing Weak Public-Key Cryptography on Strong One-Way Functions -- Technical Session 3 -- Which Languages Have 4-Round Zero-Knowledge Proofs? -- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge -- General Properties of Quantum Zero-Knowledge Proofs -- Technical Session 4 -- The Layered Games Framework for Specifications and Analysis of Security Protocols -- Universally Composable Multi-party Computation with an Unreliable Common Reference String -- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries -- Fast Private Norm Estimation and Heavy Hitters -- Technical Session 5 -- Matroids Can Be Far from Ideal Secret Sharing -- Perfectly-Secure MPC with Linear Communication Complexity -- MPC vs. SFE: Perfect Security in a Unified Corruption Model -- Invited Talk -- Bridging Game Theory and Cryptography: Recent Results and Future Directions -- Technical Session 6 -- Verifiably Secure Devices -- Lower Bounds on Implementing Robust and Resilient Mediators -- Cryptography and Game Theory: Designing Protocols for Exchanging Information -- Technical Session 7 -- Equivocal Blind Signatures and Adaptive UC-Security -- P-signatures and Noninteractive Anonymous Credentials -- Technical Session 8 -- Multi-property Preserving Combiners for Hash Functions -- OT-Combiners via Secure Computation -- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way -- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One -- Technical Session 9 -- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval -- Randomness Extraction Via ?-Biased Masking in the Presence of a Quantum Attacker -- Technical Session 10 -- An Equivalence Between Zero Knowledge and Commitments -- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model -- Technical Session 11 -- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization -- On Constant-Round Concurrent Zero-Knowledge -- Technical Session 12 -- Concurrent Non-malleable Commitments from Any One-Way Function -- Faster and Shorter Password-Authenticated Key Exchange -- Technical Session 13 -- Saving Private Randomness in One-Way Functions and Pseudorandom Generators -- Degradation and Amplification of Computational Hardness. |
| Record Nr. | UNISA-996465758003316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||