Private interactive communication across an adversarial channel

DOI10.1145/2554797.2554812MaRDI QIDQ2988873zbMATH OpenOpenAlexFDO

Authors Ran Gelles, Amit Sahai, Akshay Wadia

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.2554812

zbMATH Keywords

information-theoretic securitycodingprivate function evaluationadversarial noiseinteractive communication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Secure two-party computation over unreliable channels
• Communication complexity of secure distributed computation in the presence of noise
• New Lower Bounds for Privacy in Communication Protocols

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

(4)

• Interactive Coding for Interactive Proofs
• Fast interactive coding against adversarial noise
• Reliable communication over highly connected noisy networks
• Asynchronous Secure Communication Tolerating Mixed Adversaries

This page was built for publication: Private interactive communication across an adversarial channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988873)