Simple and Provable Secure Strong Designated Verifier Signature Schemes.

Sunder Lal, Vandani Verma

Jincao Meng, Chaoyang Li, Xiangjun Xin

Martianus Frederic Ezerman, Hyung Tae Lee, San Ling +2 more

Jie Cai, Han Jiang, Pingyuan Zhang +4 more

In this paper, we propose an ID-based strong designated verifier signature (SDVS) over R - SIS assumption in the random model. We remove pre-image sampling function and Bonsai trees such complex structures used in previous lattice-based SDVS schemes. We only utilize simple rejection sampling to protect the security of our scheme. Hence, we will show our design has the shortest signature size comparing with existing lattice-based ID-based SDVS schemes. In addition, our scheme satisfies anonymity (privacy of signer’s identity) proved in existing schemes rarely, and it can resist side-channel attacks with uniform sampling.

Ling Zhang, Jiahao Zhang, Xiangjun Xin +2 more

Huafei Zhu

In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.