Cryptogenography

DOI10.1145/2554797.2554800MaRDI QIDQ2988864zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

information theorycryptographycommunication complexitycryptogenography

Mathematics Subject Classification ID

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)

Recommendations

• Improved protocols and hardness results for the two-player cryptogenography problem
• Information theoretical cryptogenography
• Information theoretical cryptogenography
• Secret sets and applications
• Cryptographic defense against traffic analysis

Cites work

• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(15)

• Crypto Santa
• Improved protocols and hardness results for the two-player cryptogenography problem
• Individual cryptography
• Asymmetric cryptographic algorithms
• scientific article; zbMATH DE number 6536418 (Why is no real title available?)
• CS-Cipher
• Cryptographically Generated Addresses (CGA)
• Fine-Grained Cryptography
• Edge Eavesdropping Games
• Computational and Information Science
• Information theoretical cryptogenography
• A cryptographer's Conspiracy Santa
• Recent Trends in Algebraic Development Techniques
• 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)