Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AMC
2005

favoriteEmaildiscussreport

124views more AMC 2005»

An efficient undeniable group-oriented signature scheme

13 years 4 months ago

An efficient undeniable group-oriented signature scheme

Download msn.iecs.fcu.edu.tw

Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the best known example), discrete logarithm systems (such as DSA) and elliptic curve cryptosystems (ECC) [Math. Comput. 48 (1987) 203; Advances in CryptologyCrypto

Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen

Real-time Traffic

AMC 2005 | Cryptosystems | Elliptic Curve | Elliptic Curve Cryptosystem |

claim paper

Related Content

» An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification

» New Approach for Selectively Convertible Undeniable Signature Schemes

» New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications

» Limited Verifier Signature from Bilinear Pairings

» Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	AMC
Authors	Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen

Comments (0)