作者: Christian Hanser , Daniel Slamanig
关键词: Computer science 、 Scheme (programming language) 、 Theoretical computer science 、 Digital signature 、 Field (computer science) 、 Elliptic curve 、 Computer security model 、 Blank 、 Computer security 、 Signature (logic) 、 Blind signature 、 Ring signature
摘要: In this paper we present a novel type of digital signatures, which call blank signatures. The basic idea behind scheme is that an originator can define and sign message template, describing fixed parts as well multiple choices for exchangeable message. One may think form with fields, where such fields the specifies all allowed strings to choose from. Then, proxy given power instantiation template signed by using some secret information. By instantiation, commits one choice per field in template. resulting signature be publicly verified under originator's proxy's verification keys. Thereby, no verifying party except learn anything about "unused" from signature. Consequently, hidden verifiers.We discuss several applications, provide formal definition schemes introduce security model. Furthermore, efficient construction any secure scheme, pairing-friendly elliptic curves polynomial commitments, prove our We also detailed efficiency analysis proposed supporting its practicality. Finally, outline open issues extensions future work.