We give an efficient construction based on bilinear maps in the common random string model. Our mesh signatures have linear size, achieve everlasting perfect anonymity, and as a special case induce the most efficient and first unconditionally anonymous ring signatures without random oracles or trusted setup authorities. We prove non-repudiation from a mild extension of the SDH assumption, which we introduce and justify meticulously.
Category / Keywords: public-key cryptography / ring signatures, perfect anonymity, modularity Publication Info: Full version of an extended abstract to appear in EUROCRYPT 2007 Date: received 13 Mar 2007, last revised 30 Apr 2007 Contact author: xb at boyen org Available format(s): PDF | BibTeX Citation Version: 20070430:213000 (All versions of this report) Short URL: ia.cr/2007/094 Discussion forum: Show discussion | Start new discussion