Theory of Cryptography
Springer Berlin (Verlag)
978-3-662-53643-8 (ISBN)
The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016.
The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.
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 andEasy.- 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.
| Erscheinungsdatum | 24.11.2016 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XV, 578 p. 32 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | adaptive secure computation • algebraic manipulation detection • Applications • Bitcoin • Cloud Computing • coin-tossing • Computer Science • conference proceedings • Cryptocurrency • data encryption • humancoin • Informatics • Leakage-resilient cryptography • lossy encryption • minimal assumptions • oblivious transfer • proof of human work • public-key encryption • quantum • Research • secure computation • secure data outsourcing • Secure Multiparty Computation • security definitions • Stream Ciphers • verifiable delegation of computation |
| ISBN-10 | 3-662-53643-9 / 3662536439 |
| ISBN-13 | 978-3-662-53643-8 / 9783662536438 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
