Welcome to the resource topic for 2024/1581
Title:
\mathsf{Protoss} Protocol for Tight Optimal Symmetric Security
Authors: Emanuele Di Giandomenico, Yong Li, Sven Schäge
Abstract:We present \mathsf{Protoss}, a new balanced PAKE protocol with optimal communication efficiency. Messages are only 160 bits long and the computational complexity is lower than all previous approaches. Our protocol is proven secure in the random oracle model and features a security proof in a strong security model with multiple parties and multiple sessions, while allowing for generous attack queries including multiple \mathsf{Test}-queries. Moreover, the proof is in the practically relevant single-bit model (that is harder to achieve than the multiple-bit model) and tightly reduces to the Strong Square Diffie-Hellman assumption (SSQRDH). This allows for very efficient, theoretically-sound instantiations and tight compositions with symmetric primitives.
ePrint: https://eprint.iacr.org/2024/1581
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .