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.
Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part III / / Rafael Pass, Krzysztof Pietrzak (Eds.)
| Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part III / / Rafael Pass, Krzysztof Pietrzak (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 673 p. 395 illus., 11 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64381-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Universal Composition with Global Subroutines: Capturing Global Setup within plain UC -- Security analysis of SPAKE2+ -- Schrödinger's Pirate: How To Trace a Quantum Decoder -- Quantum Encryption with Certified Deletion -- Secure Quantum Extraction Protocols -- Non-interactive Classical Verification of Quantum Computation -- Classical Verification of Quantum Computations with Efficient Verifier -- Coupling of Random Systems -- Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity -- Zero-Communication Reductions -- Lower Bounds on the Time/Memory Tradeoff of Function Inversion -- Super-Linear Time-Memory Trade-Offs for Symmetric Encryption -- Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions -- On the Security of Time-Lock Puzzles and Timed Commitments -- Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness -- On the Complexity of Arithmetic Secret Sharing -- Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries -- The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs -- Transparent Error Correcting in a Computationally Bounded World -- New Techniques in Replica Encodings with Client Setup. |
| Record Nr. | UNINA-9910447246303321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part II / / Rafael Pass, Krzysztof Pietrzak (Eds.)
| Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part II / / Rafael Pass, Krzysztof Pietrzak (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 715 p. 139 illus., 25 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64378-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model. |
| Record Nr. | UNISA-996418302103316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of cryptography . Part I : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings / / Rafael Pass, Krzysztof Pietrzak (editors)
| Theory of cryptography . Part I : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings / / Rafael Pass, Krzysztof Pietrzak (editors) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XVI, 707 p. 54 illus., 3 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64375-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lossiness and Entropic Hardness for Ring-LWE -- Multi-key Fully-Homomorphic Encryption in the Plain Model -- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions -- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting -- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model -- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark) -- Functional Encryption for Quadratic Functions from k-Lin, Revisited -- On Perfect Correctness in (Lockable) Obfuscation -- Can a Public Blockchain Keep a Secret -- Blockchains from Non-Idealized Hash Functions -- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication -- Expected Constant Round Byzantine Broadcast under Dishonest Majority -- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions -- A Lower Bound for One-Round Oblivious RAM -- Lower Bounds for Multi-Server Oblivious RAMs -- On Computational Shortcuts for Information-Theoretic PIR -- Characterizing Deterministic-Prover Zero Knowledge -- NIZK from SNARG -- Weakly Extractable One-Way Functions -- Towards Non-Interactive Witness Hiding -- FHE-Based Bootstrapping of Designated-Prover NIZK -- Perfect Zero Knowledge: New Upperbounds and Relativized Separations. |
| Record Nr. | UNISA-996418312303316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part III / / Rafael Pass, Krzysztof Pietrzak (Eds.)
| Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part III / / Rafael Pass, Krzysztof Pietrzak (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 673 p. 395 illus., 11 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64381-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Universal Composition with Global Subroutines: Capturing Global Setup within plain UC -- Security analysis of SPAKE2+ -- Schrödinger's Pirate: How To Trace a Quantum Decoder -- Quantum Encryption with Certified Deletion -- Secure Quantum Extraction Protocols -- Non-interactive Classical Verification of Quantum Computation -- Classical Verification of Quantum Computations with Efficient Verifier -- Coupling of Random Systems -- Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity -- Zero-Communication Reductions -- Lower Bounds on the Time/Memory Tradeoff of Function Inversion -- Super-Linear Time-Memory Trade-Offs for Symmetric Encryption -- Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions -- On the Security of Time-Lock Puzzles and Timed Commitments -- Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness -- On the Complexity of Arithmetic Secret Sharing -- Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries -- The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs -- Transparent Error Correcting in a Computationally Bounded World -- New Techniques in Replica Encodings with Client Setup. |
| Record Nr. | UNISA-996418301403316 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part II / / Rafael Pass, Krzysztof Pietrzak (Eds.)
| Theory of cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings, part II / / Rafael Pass, Krzysztof Pietrzak (Eds.) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XII, 715 p. 139 illus., 25 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64378-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model. |
| Record Nr. | UNINA-9910447246403321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory of cryptography . Part I : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings / / Rafael Pass, Krzysztof Pietrzak (editors)
| Theory of cryptography . Part I : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, proceedings / / Rafael Pass, Krzysztof Pietrzak (editors) |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2020] |
| Descrizione fisica | 1 online resource (XVI, 707 p. 54 illus., 3 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico | Data encryption (Computer science) |
| ISBN | 3-030-64375-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lossiness and Entropic Hardness for Ring-LWE -- Multi-key Fully-Homomorphic Encryption in the Plain Model -- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions -- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting -- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model -- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark) -- Functional Encryption for Quadratic Functions from k-Lin, Revisited -- On Perfect Correctness in (Lockable) Obfuscation -- Can a Public Blockchain Keep a Secret -- Blockchains from Non-Idealized Hash Functions -- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication -- Expected Constant Round Byzantine Broadcast under Dishonest Majority -- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions -- A Lower Bound for One-Round Oblivious RAM -- Lower Bounds for Multi-Server Oblivious RAMs -- On Computational Shortcuts for Information-Theoretic PIR -- Characterizing Deterministic-Prover Zero Knowledge -- NIZK from SNARG -- Weakly Extractable One-Way Functions -- Towards Non-Interactive Witness Hiding -- FHE-Based Bootstrapping of Designated-Prover NIZK -- Perfect Zero Knowledge: New Upperbounds and Relativized Separations. |
| Record Nr. | UNINA-9910447249503321 |
| Cham, Switzerland : , : Springer, , [2020] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||