On Ideal Lattices and Learning with Errors over Rings (Englisch)
Freier Zugriff
- Neue Suche nach: Lyubashevsky, Vadim
- Neue Suche nach: Peikert, Chris
- Neue Suche nach: Regev, Oded
- Neue Suche nach: Lyubashevsky, Vadim
- Neue Suche nach: Peikert, Chris
- Neue Suche nach: Regev, Oded
In:
Advances in Cryptology – EUROCRYPT 2010
1
;
1-23
;
2010
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:On Ideal Lattices and Learning with Errors over Rings
-
Beteiligte:
-
Erschienen in:Advances in Cryptology – EUROCRYPT 2010 , 1 ; 1-23Lecture Notes in Computer Science ; 6110, 1 ; 1-23
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.2010
-
Format / Umfang:23 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
On Ideal Lattices and Learning with Errors over RingsLyubashevsky, Vadim / Peikert, Chris / Regev, Oded et al. | 2010
- 24
-
Fully Homomorphic Encryption over the IntegersDijk, Marten / Gentry, Craig / Halevi, Shai / Vaikuntanathan, Vinod et al. | 2010
- 44
-
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order GroupsFreeman, David Mandell et al. | 2010
- 62
-
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product EncryptionLewko, Allison / Okamoto, Tatsuaki / Sahai, Amit / Takashima, Katsuyuki / Waters, Brent et al. | 2010
- 92
-
Secure Obfuscation for Encrypted SignaturesHada, Satoshi et al. | 2010
- 113
-
Public-Key Encryption in the Bounded-Retrieval ModelAlwen, Joël / Dodis, Yevgeniy / Naor, Moni / Segev, Gil / Walfish, Shabsi / Wichs, Daniel et al. | 2010
- 135
-
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy CasesFaust, Sebastian / Rabin, Tal / Reyzin, Leonid / Tromer, Eran / Vaikuntanathan, Vinod et al. | 2010
- 157
-
Partial Fairness in Secure Two-Party ComputationGordon, S. Dov / Katz, Jonathan et al. | 2010
- 177
-
Secure Message Transmission with Small Public DiscussionGaray, Juan / Givens, Clint / Ostrovsky, Rafail et al. | 2010
- 197
-
On the Impossibility of Three-Move Blind Signature SchemesFischlin, Marc / Schröder, Dominique et al. | 2010
- 216
-
Efficient Device-Independent Quantum Key DistributionHänggi, Esther / Renner, Renato / Wolf, Stefan et al. | 2010
- 235
-
New Generic Algorithms for Hard KnapsacksHowgrave-Graham, Nick / Joux, Antoine et al. | 2010
- 257
-
Lattice Enumeration Using Extreme PruningGama, Nicolas / Nguyen, Phong Q. / Regev, Oded et al. | 2010
- 279
-
Algebraic Cryptanalysis of McEliece Variants with Compact KeysFaugère, Jean-Charles / Otmani, Ayoub / Perret, Ludovic / Tillich, Jean-Pierre et al. | 2010
- 299
-
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 RoundsBiryukov, Alex / Dunkelman, Orr / Keller, Nathan / Khovratovich, Dmitry / Shamir, Adi et al. | 2010
- 320
-
Cryptography between Wonderland and UnderlandYung, Moti et al. | 2010
- 322
-
Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and OthersBiryukov, Alex / Nikolić, Ivica et al. | 2010
- 345
-
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTRPaterson, Kenneth G. / Watson, Gaven J. et al. | 2010
- 362
-
Computational Soundness, Co-induction, and Encryption CyclesMicciancio, Daniele et al. | 2010
- 381
-
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening AttacksFehr, Serge / Hofheinz, Dennis / Kiltz, Eike / Wee, Hoeteck et al. | 2010
- 403
-
Cryptographic Agility and Its Relation to Circular EncryptionAcar, Tolga / Belenkiy, Mira / Bellare, Mihir / Cash, David et al. | 2010
- 423
-
Bounded Key-Dependent Message SecurityBarak, Boaz / Haitner, Iftach / Hofheinz, Dennis / Ishai, Yuval et al. | 2010
- 445
-
Perfectly Secure Multiparty Computation and the Computational Overhead of CryptographyDamgård, Ivan / Ishai, Yuval / Krøigaard, Mikkel et al. | 2010
- 466
-
Adaptively Secure BroadcastHirt, Martin / Zikas, Vassilis et al. | 2010
- 486
-
Universally Composable Quantum Multi-party ComputationUnruh, Dominique et al. | 2010
- 506
-
A Simple BGN-Type Cryptosystem from LWEGentry, Craig / Halevi, Shai / Vaikuntanathan, Vinod et al. | 2010
- 523
-
Bonsai Trees, or How to Delegate a Lattice BasisCash, David / Hofheinz, Dennis / Kiltz, Eike / Peikert, Chris et al. | 2010
- 553
-
Efficient Lattice (H)IBE in the Standard ModelAgrawal, Shweta / Boneh, Dan / Boyen, Xavier et al. | 2010
- 573
-
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of OperationLee, Jooyoung / Steinberger, John et al. | 2010
- 597
-
Stam’s Collision Resistance ConjectureSteinberger, John et al. | 2010
- 616
-
Universal One-Way Hash Functions via Inaccessible EntropyHaitner, Iftach / Holenstein, Thomas / Reingold, Omer / Vadhan, Salil / Wee, Hoeteck et al. | 2010
- 638
-
Constant-Round Non-malleable Commitments from Sub-exponential One-Way FunctionsPass, Rafael / Wee, Hoeteck et al. | 2010
- 656
-
Constructing Verifiable Random Functions with Large Input SpacesHohenberger, Susan / Waters, Brent et al. | 2010
- 673
-
Adaptive Trapdoor Functions and Chosen-Ciphertext SecurityKiltz, Eike / Mohassel, Payman / O’Neill, Adam et al. | 2010