Mobile Conference Scheme Based on Verifiable Random Number

Author

Liu, Yining ; Cao, Jianyu ; Zeng, Min

Author_Institution

Sch. of Math. & Comput. Sci., Guilin Univ. of Electron. Technol., Guilin, China

fYear

2009

fDate

26-28 Dec. 2009

Firstpage

177

Lastpage

180

Abstract

The previous conference schemes for mobile communications focus on establishment, distributing and updating of shared key for conferees, which cannot prevent conferees from submitting fraud message or invalid message. The improvement scheme based on verifiable random number which is constructed with interpolating polynomial reduces the probability of rubbish information in the mobile conference greatly.

Keywords

interpolation; mobile communication; polynomial approximation; probability; public key cryptography; telecommunication computing; teleconferencing; fraud message; interpolating polynomial; invalid message; mobile communications; mobile conference scheme; rubbish information probability; shared key update; verifiable random number; Bridges; Computer crime; Cryptography; Data security; Distributed computing; Galois fields; Mobile communication; Mobile computing; Polynomials; Protocols; digital signature; finite field; interpolating polynomial; mobile conference; verifiable random number;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Science and Engineering (ISISE), 2009 Second International Symposium on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-6325-1

Electronic_ISBN

978-1-4244-6326-8

Type

conf

DOI

10.1109/ISISE.2009.14

Filename

5447164