✦ LIBER ✦

[Lecture Notes in Computer Science] Theory of Cryptography Volume 6597 || Input Locality and Hardness Amplification

✍ Scribed by Ishai, Yuval

Book ID: 111963460
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 422 KB
Category: Article
ISBN: 3642195717
DOI: 10.1007/978-3-642-19571-6_1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory of Cryptography Volume 4392 || Multi-authority Attribute Based Encryption

✍ Vadhan, Salil P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 509 KB

[Lecture Notes in Computer Science] Codi

[Lecture Notes in Computer Science] Coding and Cryptography Volume 3969 || Locally Invertible Multivariate Polynomial Matrices

✍ Ytrehus, Øyvind 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 493 KB

[Lecture Notes in Computer Science] Post

[Lecture Notes in Computer Science] Post-Quantum Cryptography Volume 5299 || McEliece Cryptosystem Implementation: Theory and Practice

✍ Buchmann, Johannes; Ding, Jintai 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 374 KB

This Book Constitutes The Refereed Proceedings Of The Second International Workshop On Post-quantum Cryptography, Pqcrypto 2008, Held In Cincinnati, Oh, Usa, In October 2008. The 15 Revised Full Papers Presented Were Carefully Reviewed And Selected From Numerous Submissions. Quantum Computers Are Pr

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory of Cryptography Volume 3378 || Characterizing Ideal Weighted Threshold Secret Sharing

✍ Kilian, Joe 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 260 KB

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory of Cryptography Volume 4392 || On Secret Sharing Schemes, Matroids and Polymatroids

✍ Vadhan, Salil P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 473 KB

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory of Cryptography Volume 3876 || Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness

✍ Halevi, Shai; Rabin, Tal 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 503 KB

This Book Constitutes The Refereed Proceedings Of The Third Theory Of Cryptography Conference, Tcc 2006, Held In March 2006. The 31 Revised Full Papers Presented Were Carefully Reviewed And Selected From 91 Submissions. The Papers Are Organized In Topical Sections On Zero-knowledge, Primitives, Assu