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 [[electronic resource] ] : 11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings / / edited by Yehuda Lindell
| Theory of Cryptography [[electronic resource] ] : 11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings / / edited by Yehuda Lindell |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 739 p. 59 illus.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers Algorithms Computer science—Mathematics Cryptology Systems and Data Security Computation by Abstract Devices Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-642-54242-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding -- Obfuscation for Evasive Functions -- On Extractability Obfuscation -- Two-Round Secure MPC from Indistinguishability Obfuscation -- Chosen Ciphertext Security via Point Obfuscation -- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge -- Achieving Constant Round Leakage-Resilient Zero-Knowledge -- Statistical Concurrent Non-malleable Zero Knowledge -- 4-Round Resettably-Sound Zero Knowledge -- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? -- On the Power of Public-Key Encryption in Secure Computation -- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations -- Towards Characterizing Complete Fairness in Secure Two-Party Computation -- On the Cryptographic Complexity of the Worst Functions -- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol -- One-Sided Adaptively Secure Two-Party Computation -- Multi-linear Secret-Sharing -- Broadcast Amplification -- Non-malleable Coding against Bit-Wise and Split-State Tampering -- Continuous Non-malleable Codes -- Locally Updatable and Locally Decodable Codes -- Leakage Resilient Fully Homomorphic Encryption -- Securing Circuits and Protocols against 1/ poly(k) Tampering Rate -- How to Fake Auxiliary Input -- Standard versus Selective Opening Security: Separation and Equivalence Results -- Dual System Encryption via Predicate Encodings -- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens -- Lower Bounds in the Hardware Token Model -- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures -- On the Impossibility of Structure-Preserving Deterministic Primitives. |
| Record Nr. | UNISA-996205173203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of Cryptography : 11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings / / edited by Yehuda Lindell
| Theory of Cryptography : 11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings / / edited by Yehuda Lindell |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 739 p. 59 illus.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers Algorithms Computer science—Mathematics Cryptology Systems and Data Security Computation by Abstract Devices Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-642-54242-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding -- Obfuscation for Evasive Functions -- On Extractability Obfuscation -- Two-Round Secure MPC from Indistinguishability Obfuscation -- Chosen Ciphertext Security via Point Obfuscation -- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge -- Achieving Constant Round Leakage-Resilient Zero-Knowledge -- Statistical Concurrent Non-malleable Zero Knowledge -- 4-Round Resettably-Sound Zero Knowledge -- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? -- On the Power of Public-Key Encryption in Secure Computation -- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations -- Towards Characterizing Complete Fairness in Secure Two-Party Computation -- On the Cryptographic Complexity of the Worst Functions -- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol -- One-Sided Adaptively Secure Two-Party Computation -- Multi-linear Secret-Sharing -- Broadcast Amplification -- Non-malleable Coding against Bit-Wise and Split-State Tampering -- Continuous Non-malleable Codes -- Locally Updatable and Locally Decodable Codes -- Leakage Resilient Fully Homomorphic Encryption -- Securing Circuits and Protocols against 1/ poly(k) Tampering Rate -- How to Fake Auxiliary Input -- Standard versus Selective Opening Security: Separation and Equivalence Results -- Dual System Encryption via Predicate Encodings -- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens -- Lower Bounds in the Hardware Token Model -- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures -- On the Impossibility of Structure-Preserving Deterministic Primitives. |
| Record Nr. | UNINA-9910483136803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Tutorials on the Foundations of Cryptography : Dedicated to Oded Goldreich / / edited by Yehuda Lindell
| Tutorials on the Foundations of Cryptography : Dedicated to Oded Goldreich / / edited by Yehuda Lindell |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XV, 450 p. 26 illus., 5 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Information Security and Cryptography |
| Soggetto topico |
Data structures (Computer science)
Computers Data Structures and Information Theory Theory of Computation |
| ISBN | 3-319-57048-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Garbled Circuits as Randomized Encodings of Functions: A Primer -- The Complexity of Public-Key Cryptography -- Pseudorandom Functions: Three Decades Later -- The Many Entropies in One-Way Functions -- Homomorphic Encryption -- How to Simulate It: A Tutorial on the Simulation Proof Technique -- The Complexity of Differential Privacy. |
| Record Nr. | UNINA-9910254830303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||