Blank digital signatures

作者: Christian Hanser , Daniel Slamanig

DOI: 10.1145/2484313.2484324

关键词: Computer scienceScheme (programming language)Theoretical computer scienceDigital signatureField (computer science)Elliptic curveComputer security modelBlankComputer securitySignature (logic)Blind signatureRing 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.

参考文章(21)
Joseph H. Silverman, The Arithmetic of Elliptic Curves ,(1986)
Marek Klonowski, Anna Lauks, Extended sanitizable signatures international conference on information security and cryptology. pp. 343- 355 ,(2006) , 10.1007/11927587_28
Sébastien Canard, Amandine Jambert, On extended sanitizable signature schemes the cryptographers track at the rsa conference. pp. 179- 194 ,(2010) , 10.1007/978-3-642-11925-5_13
Jacob C. N. Schuldt, Kanta Matsuura, Kenneth G. Paterson, Proxy Signatures Secure Against Proxy Key Exposure Public Key Cryptography – PKC 2008. pp. 141- 161 ,(2008) , 10.1007/978-3-540-78440-1_9
Robert Johnson, David Molnar, Dawn Song, David Wagner, Homomorphic Signature Schemes the cryptographers track at the rsa conference. pp. 244- 262 ,(2002) , 10.1007/3-540-45760-7_17
Ralph C. Merkle, A Digital Signature Based on a Conventional Encryption Function international cryptology conference. pp. 369- 378 ,(1987) , 10.1007/3-540-48184-2_32
Josh Benaloh, Michael de Mare, One-way accumulators: a decentralized alternative to digital signatures theory and application of cryptographic techniques. pp. 274- 285 ,(1994) , 10.1007/3-540-48285-7_24
Torben Pryds Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing international cryptology conference. pp. 129- 140 ,(1991) , 10.1007/3-540-46766-1_9
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg, Constant-size commitments to polynomials and their applications international conference on the theory and application of cryptology and information security. pp. 177- 194 ,(2010) , 10.1007/978-3-642-17373-8_11
Atsuko Miyaji, Shunzou Takano, Masaki Nakabayashi, New Explicit Conditions of Elliptic Curve Traces for FR-Reduction IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 84, pp. 1234- 1243 ,(2001)