Cryptogenography
DOI10.1145/2554797.2554800zbMATH Open1364.94529OpenAlexW4251703220MaRDI QIDQ2988864FDOQ2988864
Authors: Joshua Brody, Sune Kristian Jakobsen, D. Scheder, Peter Winkler 
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554800
Recommendations
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New lattice-based cryptographic constructions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Toward basing fully homomorphic encryption on worst-case hardness
Cited In (15)
- Crypto Santa
- Improved protocols and hardness results for the two-player cryptogenography problem
- Individual cryptography
- Asymmetric cryptographic algorithms
- Title not available (Why is that?)
- CS-Cipher
- Cryptographically Generated Addresses (CGA)
- Fine-Grained Cryptography
- Edge Eavesdropping Games
- Computational and Information Science
- A cryptographer's Conspiracy Santa
- Recent Trends in Algebraic Development Techniques
- Information theoretical cryptogenography
- Information theoretical cryptogenography
- Cryptographic sensing
This page was built for publication: Cryptogenography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988864)
