Theory of Cryptography [[electronic resource] ] : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I / / edited by Martin Hirt, Adam Smith |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 692 p. 85 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Management information systems Computer science Computer communication systems Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-662-53641-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao’s Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing. . |
Record Nr. | UNISA-996465612703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theory of Cryptography [[electronic resource] ] : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II / / edited by Martin Hirt, Adam Smith |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XV, 578 p. 32 illus.) |
Disciplina | 004 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Management information systems Computer science Computer communication systems Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-662-53644-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Delegation and IP -- Delegating RAM Computations with Adaptive Soundness and Privacy -- Interactive Oracle Proofs -- Adaptive Succinct Garbled RAM, or How To Delegate Your Database.-Delegating RAM Computations -- Public-Key Encryption -- Standard Security Does Not Imply Indistinguishability Under Selective Opening -- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts -- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function -- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms -- Multi-Key FHE from LWE, Revisited -- Obfuscation and Multilinear Maps -- Secure Obfuscation in a Weak Multilinear Map Model -- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents -- Attribute-Based Encryption -- Deniable Attribute Based Encryption for Branching Programs from LWE -- Targeted Homomorphic Attribute-Based Encryption -- Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy -- Functional Encryption -- From Cryptomania to Obfustopia through Secret-Key Functional Encryption -- Single-Key to Multi-Key Functional Encryption with Polynomial Loss -- Compactness vs Collusion Resistance in Functional Encryption -- Secret Sharing -- Threshold Secret Sharing Requires a Linear Size Alphabet -- How to Share a Secret, Infinitely -- New Models -- Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond -- Access Control Encryption: Enforcing Information Flow with Cryptography. |
Record Nr. | UNISA-996465626903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theory of Cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I / / edited by Martin Hirt, Adam Smith |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 692 p. 85 illus.) |
Disciplina | 005.82 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Management information systems Computer science Computer networks Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-662-53641-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | TCC Test-of-Time Award -- From Indifferentiability to Constructive Cryptography (and Back) -- Foundations -- Fast Pseudorandom Functions Based on Expander Graphs -- 3-Message Zero Knowledge Against Human Ignorance -- The GGM Function Family is a Weakly One-Way Family of Functions -- On the (In)security of SNARKs in the Presence of Oracles -- Leakage Resilient One-Way Functions: The Auxiliary-Input Setting -- Simulating Auxiliary Inputs, Revisited -- Unconditional Security -- Pseudoentropy: Lower-bounds for Chain rules and Transformations -- Oblivious Transfer from Any Non-Trivial Elastic Noisy Channel via Secret Key Agreement -- Simultaneous Secrecy and Reliability Amplification for a General Channel Model -- Proof of Space from Stacked Expanders -- Perfectly Secure Message Transmission in Two Rounds -- Foundations of Multi-Party Protocols -- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious -- Binary AMD Circuits from Secure Multiparty Computation -- Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity -- Composable Adaptive Secure Protocols without Setup under Polytime Assumptions -- Adaptive Security of Yao’s Garbled Circuits -- Round Complexity and Efficiency of Multi-Party Computation -- Efficient Secure Multiparty Computation with Identifiable Abort -- Secure Multiparty RAM Computation in Constant Rounds -- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model -- More Efficient Constant-Round Multi-Party Computation from BMR and SHE -- Cross&Clean: Amortized Garbled Circuits With Constant Overhead -- Differential Privacy -- Separating Computational and Statistical Differential Privacy in the Client-Server Model -- Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds -- Strong Hardness of Privacy from Weak Traitor Tracing. . |
Record Nr. | UNINA-9910483826803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Theory of Cryptography : 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II / / edited by Martin Hirt, Adam Smith |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XV, 578 p. 32 illus.) |
Disciplina | 004 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer security Algorithms Computer science—Mathematics Management information systems Computer science Computer networks Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-662-53644-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Delegation and IP -- Delegating RAM Computations with Adaptive Soundness and Privacy -- Interactive Oracle Proofs -- Adaptive Succinct Garbled RAM, or How To Delegate Your Database.-Delegating RAM Computations -- Public-Key Encryption -- Standard Security Does Not Imply Indistinguishability Under Selective Opening -- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts -- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function -- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms -- Multi-Key FHE from LWE, Revisited -- Obfuscation and Multilinear Maps -- Secure Obfuscation in a Weak Multilinear Map Model -- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents -- Attribute-Based Encryption -- Deniable Attribute Based Encryption for Branching Programs from LWE -- Targeted Homomorphic Attribute-Based Encryption -- Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy -- Functional Encryption -- From Cryptomania to Obfustopia through Secret-Key Functional Encryption -- Single-Key to Multi-Key Functional Encryption with Polynomial Loss -- Compactness vs Collusion Resistance in Functional Encryption -- Secret Sharing -- Threshold Secret Sharing Requires a Linear Size Alphabet -- How to Share a Secret, Infinitely -- New Models -- Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond -- Access Control Encryption: Enforcing Information Flow with Cryptography. |
Record Nr. | UNINA-9910484378403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|