Abstract
Recently, Tseng and Jan presented anonymous conference key distribution systems that make use of the interpolating properties of polynomials. However, their protocol has some limitations in that users are not able to check the correctness of the distributed conference key but also verify if they take part in any particular protocol run. This leads to the possibility of an active attack. In this article, we show that Tseng and Jan’s protocol does not work properly because of its incompleteness. We also describe a simple and promising remedy to such a problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
