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 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part I / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part I / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XXIII, 870 p. 624 illus., 36 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56784-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Security models -- Handling Adaptive Compromise for Practical Encryption Schemes -- Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees -- Indifferentiability for Public Key Cryptosystems -- Quantifying the Security Cost of Migrating Protocols to Practice -- Symmetric and Real World Cryptography -- The Memory-Tightness of Authenticated Encryption -- Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions -- The Summation-Truncation Hybrid: Reusing Discarded Bits for Free -- Security Analysis of NIST CTR-DRBG -- Security Analysis and Improvements for the IETF MLS Standard for Group Messaging -- Universally Composable Relaxed Password Authenticated Key Exchange -- Anonymous Tokens with Private Metadata Bit -- Hardware Security and Leakage Resilience -- Random Probing Security: Verification, Composition, Expansion and New Constructions -- Mode-Level vs. Implementation-Level Physical Security in Symmetric Cryptography: A Practical Guide Through the Leakage-Resistance Jungle -- Leakage-Resilient Key Exchange and Two-Seed Extractors -- Outsourced encryption -- Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model -- Fast and Secure Updatable Encryption -- Incompressible Encodings -- Constructions -- New Constructions of Hinting PRGs, OWFs with Encryption, and more -- Adaptively Secure Constrained Pseudorandom Functions in the Standard Model -- Collusion Resistant Watermarkable PRFs from Standard Assumptions -- Verifiable Registration-Based Encryption -- New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings -- Public Key Cryptography -- Functional Encryption for Attribute-Weighted Sums from k-Lin -- Amplifying the Security of Functional Encryption, Unconditionally -- Dynamic Decentralized Functional Encryption -- On Succinct Arguments and Witness Encryption from Groups -- Fully Deniable Interactive Encryption -- Chosen Ciphertext Security from Injective Trapdoor Functions. |
| Record Nr. | UNISA-996418315803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part I / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part I / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XXIII, 870 p. 624 illus., 36 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56784-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Security models -- Handling Adaptive Compromise for Practical Encryption Schemes -- Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees -- Indifferentiability for Public Key Cryptosystems -- Quantifying the Security Cost of Migrating Protocols to Practice -- Symmetric and Real World Cryptography -- The Memory-Tightness of Authenticated Encryption -- Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions -- The Summation-Truncation Hybrid: Reusing Discarded Bits for Free -- Security Analysis of NIST CTR-DRBG -- Security Analysis and Improvements for the IETF MLS Standard for Group Messaging -- Universally Composable Relaxed Password Authenticated Key Exchange -- Anonymous Tokens with Private Metadata Bit -- Hardware Security and Leakage Resilience -- Random Probing Security: Verification, Composition, Expansion and New Constructions -- Mode-Level vs. Implementation-Level Physical Security in Symmetric Cryptography: A Practical Guide Through the Leakage-Resistance Jungle -- Leakage-Resilient Key Exchange and Two-Seed Extractors -- Outsourced encryption -- Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model -- Fast and Secure Updatable Encryption -- Incompressible Encodings -- Constructions -- New Constructions of Hinting PRGs, OWFs with Encryption, and more -- Adaptively Secure Constrained Pseudorandom Functions in the Standard Model -- Collusion Resistant Watermarkable PRFs from Standard Assumptions -- Verifiable Registration-Based Encryption -- New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings -- Public Key Cryptography -- Functional Encryption for Attribute-Weighted Sums from k-Lin -- Amplifying the Security of Functional Encryption, Unconditionally -- Dynamic Decentralized Functional Encryption -- On Succinct Arguments and Witness Encryption from Groups -- Fully Deniable Interactive Encryption -- Chosen Ciphertext Security from Injective Trapdoor Functions. |
| Record Nr. | UNINA-9910416082803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 832 p. 448 illus., 31 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56877-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Party Computation: Two-Sided Malicious Security for Private Intersection-Sum with Cardinality -- Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF -- Multiparty Generation of an RSA Modulus -- Secret Sharing -- Non-Malleability against Polynomial Tampering -- Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model -- Nearly Optimal Robust Secret Sharing against Rushing Adversaries -- Cryptanalysis -- Cryptanalytic Extraction of Neural Network Models -- Automatic Verification of Differential Characteristics: Application to Reduced Gimli -- The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers -- Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme -- Out of Oddity -- New Cryptanalytic Techniques against Symmetric Primitives Optimized for Integrity Proof Systems -- Improved Differential-Linear Attacks with Applications to ARX Ciphers -- Cryptanalysis Results on Spook: Bringing Full-round Shadow-512 to the Light -- Cryptanalysis of LEDAcrypt -- Alzette: a 64-bit ARX-box (feat. CRAX and TRAX) -- Delay functions -- Order-Fairness for Byzantine Consensus -- Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions -- Zero Knowledge -- Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics -- A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence -- Interactive Proofs for Social Graphs -- The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More -- Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs -- PPAD-Hardness and Delegation with Unambiguous Proofs -- New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust -- Spartan: Efficient and general-purpose zkSNARKs -- NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations -- Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages -- Non-Interactive Zero-Knowledge Arguments for QMA, with preprocessing. |
| Record Nr. | UNISA-996418316303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 [[electronic resource] ] : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 856 p. 737 illus., 27 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56880-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Public Key Cryptanalysis- A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem -- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields -- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment -- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory -- A Classification of Computational Assumptions in the Algebraic Group Model -- Lattice Algorithms and Cryptanalysis -- Fast reduction of algebraic lattices over cyclotomic fields -- Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)) -- Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP -- Random Self-reducibility of Ideal-SVP via Arakelov Random Walks -- Slide Reduction, Revisited—Filling the Gaps in SVP Approximation -- Rounding in the Rings -- Lattice-based and post-quantum cryptography -- LWE with Side Information: Attacks and Concrete Security Estimation -- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM -- Efficient Pseudorandom Correlation Generators from Ring-LPN -- Scalable Pseudorandom Quantum States -- A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge -- Practical Product Proofs for Lattice Commitments.-Lattice-Based Blind Signatures, Revisited -- Multi-Party Computation -- 12171 Round-optimal Black-box Commit-and-prove with Succinct Communication -- Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability -- Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing -- Guaranteed Output Delivery Comes Free in Honest Majority MPC -- Black-Box Transformations from Passive to Covert Security with Public Verifiability -- MPC with Friends and Foes -- Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback -- Reverse Firewalls for Actively Secure MPCs -- Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path -- Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting) -- Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. |
| Record Nr. | UNISA-996418317103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 856 p. 737 illus., 27 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56880-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Public Key Cryptanalysis- A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem -- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields -- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment -- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory -- A Classification of Computational Assumptions in the Algebraic Group Model -- Lattice Algorithms and Cryptanalysis -- Fast reduction of algebraic lattices over cyclotomic fields -- Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)) -- Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP -- Random Self-reducibility of Ideal-SVP via Arakelov Random Walks -- Slide Reduction, Revisited—Filling the Gaps in SVP Approximation -- Rounding in the Rings -- Lattice-based and post-quantum cryptography -- LWE with Side Information: Attacks and Concrete Security Estimation -- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM -- Efficient Pseudorandom Correlation Generators from Ring-LPN -- Scalable Pseudorandom Quantum States -- A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge -- Practical Product Proofs for Lattice Commitments.-Lattice-Based Blind Signatures, Revisited -- Multi-Party Computation -- 12171 Round-optimal Black-box Commit-and-prove with Succinct Communication -- Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability -- Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing -- Guaranteed Output Delivery Comes Free in Honest Majority MPC -- Black-Box Transformations from Passive to Covert Security with Public Verifiability -- MPC with Friends and Foes -- Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback -- Reverse Firewalls for Actively Secure MPCs -- Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path -- Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting) -- Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. |
| Record Nr. | UNINA-9910416082703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III / / edited by Daniele Micciancio, Thomas Ristenpart
| Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III / / edited by Daniele Micciancio, Thomas Ristenpart |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XV, 832 p. 448 illus., 31 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Data structures (Computer science) Computer communication systems Computer security Application software Software engineering Cryptology Data Structures and Information Theory Computer Communication Networks Systems and Data Security Information Systems Applications (incl. Internet) Software Engineering/Programming and Operating Systems |
| ISBN | 3-030-56877-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Party Computation: Two-Sided Malicious Security for Private Intersection-Sum with Cardinality -- Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF -- Multiparty Generation of an RSA Modulus -- Secret Sharing -- Non-Malleability against Polynomial Tampering -- Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model -- Nearly Optimal Robust Secret Sharing against Rushing Adversaries -- Cryptanalysis -- Cryptanalytic Extraction of Neural Network Models -- Automatic Verification of Differential Characteristics: Application to Reduced Gimli -- The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers -- Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme -- Out of Oddity -- New Cryptanalytic Techniques against Symmetric Primitives Optimized for Integrity Proof Systems -- Improved Differential-Linear Attacks with Applications to ARX Ciphers -- Cryptanalysis Results on Spook: Bringing Full-round Shadow-512 to the Light -- Cryptanalysis of LEDAcrypt -- Alzette: a 64-bit ARX-box (feat. CRAX and TRAX) -- Delay functions -- Order-Fairness for Byzantine Consensus -- Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions -- Zero Knowledge -- Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics -- A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence -- Interactive Proofs for Social Graphs -- The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More -- Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs -- PPAD-Hardness and Delegation with Unambiguous Proofs -- New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust -- Spartan: Efficient and general-purpose zkSNARKs -- NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations -- Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages -- Non-Interactive Zero-Knowledge Arguments for QMA, with preprocessing. |
| Record Nr. | UNINA-9910416086103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||