Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
From MaRDI portal
Publication:2811125
DOI10.1007/978-3-662-48797-6_3zbMATH Open1337.94044OpenAlexW2295140071MaRDI QIDQ2811125FDOQ2811125
Authors: Dakshita Khurana, Vanishree Rao, Amit Sahai 
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_3
Recommendations
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Provably Secure N-Party Authenticated Key Exchange in the Multicast DPWA Setting
- An Unconditionally Secure Protocol for Multi-Party Set Intersection
- A bound for multiparty secret key agreement and implications for a problem of secure computing
- Multiparty Computation from Somewhat Homomorphic Encryption
Cited In (7)
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Generic hardness of inversion on ring and its relation to self-bilinear map
- Adaptive multiparty NIKE
- Indistinguishability obfuscation
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Breaking the Sub-Exponential Barrier in Obfustopia
This page was built for publication: Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811125)
