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 2021 . Part IV : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part IV : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 732 p. 112 illus., 24 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84259-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Zero Knowledge -- Witness Authenticating NIZKs and Applications -- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs -- Compressing Proofs of k-Out-Of-n Partial Knowledge -- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions -- Time- and Space-Efficient Arguments from Groups of Unknown Order -- Encryption++ -- Broadcast Encryption with Size N1/3 and More from k-Lin -- Fine-grained Secure Attribute-based Encryption -- Multi-Input Quadratic Functional Encryption from Pairings -- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE -- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved -- Foundations -- White Box Traitor Tracing -- Does Fiat-Shamir Require a Cryptographic Hash Function? -- Composition with Knowledge Assumptions -- Non-Interactive Batch Arguments for NP from Standard Assumptions -- Targeted Lossy Functions and Applications -- The t-wise Independence of Substitution-Permutation Networks -- Low-Complexity Cryptography -- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] -- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications -- No Time to Hash: On Super-Efficient Entropy Accumulation -- Protocols -- A Logarithmic Lower Bound for Oblivious RAM (for all parameters) -- Oblivious RAM with Worst-Case Logarithmic Overhead -- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time -- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model -- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange. |
| Record Nr. | UNINA-9910495162003321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part II : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part II : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 822 p. 104 illus., 40 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84245-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Party Computation -- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election -- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt -- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles -- Fluid MPC: Secure Multiparty Computation with Dynamic Participants -- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration -- Broadcast-Optimal Two Round MPC with an Honest Majority -- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer -- On the Round Complexity of Black-Box Secure MPC -- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting -- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem -- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions -- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings -- Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact -- Oblivious Key-Value Stores and Amplification for Private Set Intersection -- MHz2k: MPC from HE over ℤ2k with New Packing, Simpler Reshare, and Better ZKP -- Sublinear GMW-Style Compiler for MPC with Preprocessing -- Limits on the Adaptive Security of Yao's Garbling -- Lattice Cryptography -- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices -- A Compressed Sigma-Protocol Theory for Lattices -- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs -- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions -- Deniable Fully Homomorphic Encryption from Learning With Errors -- Lattice Cryptanalysis -- Counterexamples to New Circular Security Assumptions Underlying iO -- How to Meet Ternary LWE Keys -- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance -- Towards faster polynomial-time lattice reduction -- Lower bounds on lattice sieving and information set decoding. |
| Record Nr. | UNINA-9910495175803321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part I : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part I : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 805 p. 58 illus., 1 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84242-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Which e-voting problems do we need to solve? -- Award Papers -- On the Possibility of Basing Cryptography on EXP6 ≠ BPP -- Linear Cryptanalysis of FF3-1 and FEA -- Efficient Key Recovery for all HFE Signature Variants -- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits -- Signatures -- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions -- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses -- MuSig2: Simple Two-Round Schnorr Multi-Signatures -- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols -- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations -- Compact Ring Signatures from Learning With Errors -- Quantum Cryptography -- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds -- On the Concurrent Composition of Quantum Zero-Knowledge -- Multi-theorem Designated-Verifier NIZK for QMA -- On the Round Complexity of Secure Quantum Computation -- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort -- One-Way Functions Imply Secure Computation in a Quantum World -- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits -- New Approaches for Quantum Copy-Protection -- Hidden Cosets and Applications to Unclonable Cryptography -- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model -- Quantum Collision Attacks on Reduced SHA-256 and SHA-512 -- Succinct Arguments -- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments -- Proof-Carrying Data without Succinct Arguments -- Subquadratic SNARGs in the Random Oracle Model -- Sumcheck Arguments and their Applications -- An Algebraic Framework for Universal and Updatable SNARKs. |
| Record Nr. | UNINA-9910495216103321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part III : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part III : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 810 p. 133 illus., 68 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84252-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models -- A Rational Protocol Treatment of 51% Attacks -- MoSS: Modular Security Specifications Framework -- Tight State-Restoration Soundness in the Algebraic Group Model -- Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model -- Applied Cryptography and Side Channels -- Provable Security Analysis of FIDO2-. SSE and SSD: Page-Efficient Searchable Symmetric Encryption -- Towards Tight Random Probing Security -- Secure Wire Shuffling in the Probing Model -- Cryptanalysis -- Differential-Linear Cryptanalysis from an Algebraic Perspective -- Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks -- Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting -- Thinking Outside the Superbox -- Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques -- The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3 -- Improved torsion-point attacks on SIDH variants -- Codes and Extractors -- Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN -- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes -- Non-Malleable Codes for Bounded Parallel-Time Tampering -- Improved Computational Extractors and their Applications -- Adaptive Extractors and their Application to Leakage Resilient Secret Sharing -- Secret Sharing -- Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n -- Asymptotically-Good Arithmetic Secret Sharing over ℤ/pℓℤ with Strong Multiplication and Its Applications to Efficient MPC -- Large Message Homomorphic Secret Sharing from DCR and Applications -- Traceable Secret Sharing and Applications -- Quadratic Secret Sharing and Conditional Disclosure of Secrets -- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes. |
| Record Nr. | UNINA-9910495222103321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part III : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part III : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 810 p. 133 illus., 68 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84252-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models -- A Rational Protocol Treatment of 51% Attacks -- MoSS: Modular Security Specifications Framework -- Tight State-Restoration Soundness in the Algebraic Group Model -- Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model -- Applied Cryptography and Side Channels -- Provable Security Analysis of FIDO2-. SSE and SSD: Page-Efficient Searchable Symmetric Encryption -- Towards Tight Random Probing Security -- Secure Wire Shuffling in the Probing Model -- Cryptanalysis -- Differential-Linear Cryptanalysis from an Algebraic Perspective -- Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks -- Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting -- Thinking Outside the Superbox -- Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques -- The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3 -- Improved torsion-point attacks on SIDH variants -- Codes and Extractors -- Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN -- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes -- Non-Malleable Codes for Bounded Parallel-Time Tampering -- Improved Computational Extractors and their Applications -- Adaptive Extractors and their Application to Leakage Resilient Secret Sharing -- Secret Sharing -- Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n -- Asymptotically-Good Arithmetic Secret Sharing over ℤ/pℓℤ with Strong Multiplication and Its Applications to Efficient MPC -- Large Message Homomorphic Secret Sharing from DCR and Applications -- Traceable Secret Sharing and Applications -- Quadratic Secret Sharing and Conditional Disclosure of Secrets -- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes. |
| Record Nr. | UNISA-996464394403316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part I : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part I : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 805 p. 58 illus., 1 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84242-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Which e-voting problems do we need to solve? -- Award Papers -- On the Possibility of Basing Cryptography on EXP6 ≠ BPP -- Linear Cryptanalysis of FF3-1 and FEA -- Efficient Key Recovery for all HFE Signature Variants -- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits -- Signatures -- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions -- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses -- MuSig2: Simple Two-Round Schnorr Multi-Signatures -- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols -- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations -- Compact Ring Signatures from Learning With Errors -- Quantum Cryptography -- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds -- On the Concurrent Composition of Quantum Zero-Knowledge -- Multi-theorem Designated-Verifier NIZK for QMA -- On the Round Complexity of Secure Quantum Computation -- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort -- One-Way Functions Imply Secure Computation in a Quantum World -- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits -- New Approaches for Quantum Copy-Protection -- Hidden Cosets and Applications to Unclonable Cryptography -- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model -- Quantum Collision Attacks on Reduced SHA-256 and SHA-512 -- Succinct Arguments -- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments -- Proof-Carrying Data without Succinct Arguments -- Subquadratic SNARGs in the Random Oracle Model -- Sumcheck Arguments and their Applications -- An Algebraic Framework for Universal and Updatable SNARKs. |
| Record Nr. | UNISA-996464421603316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part II : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part II : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, Proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 822 p. 104 illus., 40 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84245-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Party Computation -- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election -- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt -- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles -- Fluid MPC: Secure Multiparty Computation with Dynamic Participants -- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration -- Broadcast-Optimal Two Round MPC with an Honest Majority -- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer -- On the Round Complexity of Black-Box Secure MPC -- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting -- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem -- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions -- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings -- Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact -- Oblivious Key-Value Stores and Amplification for Private Set Intersection -- MHz2k: MPC from HE over ℤ2k with New Packing, Simpler Reshare, and Better ZKP -- Sublinear GMW-Style Compiler for MPC with Preprocessing -- Limits on the Adaptive Security of Yao's Garbling -- Lattice Cryptography -- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices -- A Compressed Sigma-Protocol Theory for Lattices -- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs -- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions -- Deniable Fully Homomorphic Encryption from Learning With Errors -- Lattice Cryptanalysis -- Counterexamples to New Circular Security Assumptions Underlying iO -- How to Meet Ternary LWE Keys -- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance -- Towards faster polynomial-time lattice reduction -- Lower bounds on lattice sieving and information set decoding. |
| Record Nr. | UNISA-996464392803316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in cryptology -- CRYPTO 2021 . Part IV : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, proceedings / / Tal Malkin, Chris Peikert (editors)
| Advances in cryptology -- CRYPTO 2021 . Part IV : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual event, August 16-20, 2021, proceedings / / Tal Malkin, Chris Peikert (editors) |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (XV, 732 p. 112 illus., 24 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-84259-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Zero Knowledge -- Witness Authenticating NIZKs and Applications -- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs -- Compressing Proofs of k-Out-Of-n Partial Knowledge -- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions -- Time- and Space-Efficient Arguments from Groups of Unknown Order -- Encryption++ -- Broadcast Encryption with Size N1/3 and More from k-Lin -- Fine-grained Secure Attribute-based Encryption -- Multi-Input Quadratic Functional Encryption from Pairings -- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE -- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved -- Foundations -- White Box Traitor Tracing -- Does Fiat-Shamir Require a Cryptographic Hash Function? -- Composition with Knowledge Assumptions -- Non-Interactive Batch Arguments for NP from Standard Assumptions -- Targeted Lossy Functions and Applications -- The t-wise Independence of Substitution-Permutation Networks -- Low-Complexity Cryptography -- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] -- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications -- No Time to Hash: On Super-Efficient Entropy Accumulation -- Protocols -- A Logarithmic Lower Bound for Oblivious RAM (for all parameters) -- Oblivious RAM with Worst-Case Logarithmic Overhead -- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time -- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model -- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange. |
| Record Nr. | UNISA-996464445403316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Cryptography and Network Security [[electronic resource] ] : 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers / / edited by Tal Malkin, Vladimir Kolesnikov, Allison Lewko, Michalis Polychronakis
| Applied Cryptography and Network Security [[electronic resource] ] : 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers / / edited by Tal Malkin, Vladimir Kolesnikov, Allison Lewko, Michalis Polychronakis |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 698 p. 152 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Computer communication systems Management information systems Computer science Computers Computers and civilization Systems and Data Security Cryptology Computer Communication Networks Management of Computing and Information Systems Theory of Computation Computers and Society |
| ISBN | 3-319-28166-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Secure computation: primitives and new models -- Public key cryptographic primitives -- Secure computation II: applications -- Anonymity and related applications -- Cryptanalysis and attacks (symmetric crypto) -- Privacy and policy enforcement -- Authentication via eye tracking and proofs of proximity -- Malware analysis and side channel attacks -- Side channel countermeasures and tamper resistance/PUFs -- Leakage resilience and pseudorandomness. |
| Record Nr. | UNISA-996466370003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Cryptography and Network Security : 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers / / edited by Tal Malkin, Vladimir Kolesnikov, Allison Lewko, Michalis Polychronakis
| Applied Cryptography and Network Security : 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers / / edited by Tal Malkin, Vladimir Kolesnikov, Allison Lewko, Michalis Polychronakis |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 698 p. 152 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Computer communication systems Management information systems Computer science Computers Computers and civilization Systems and Data Security Cryptology Computer Communication Networks Management of Computing and Information Systems Theory of Computation Computers and Society |
| ISBN | 3-319-28166-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Secure computation: primitives and new models -- Public key cryptographic primitives -- Secure computation II: applications -- Anonymity and related applications -- Cryptanalysis and attacks (symmetric crypto) -- Privacy and policy enforcement -- Authentication via eye tracking and proofs of proximity -- Malware analysis and side channel attacks -- Side channel countermeasures and tamper resistance/PUFs -- Leakage resilience and pseudorandomness. |
| Record Nr. | UNINA-9910483660403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
