作者: Michel Abdalla , Leonid Reyzin
关键词: Algorithm 、 Theoretical computer science 、 Random oracle 、 Forward secrecy 、 Digital signature 、 Signature (logic) 、 Public-key cryptography 、 Schnorr signature 、 Computer science 、 Concrete security 、 Communication complexity
摘要: We improve the Bellare-Miner (Crypto '99) construction of signature schemes with forward security in random oracle model. Our scheme has significantly shorter keys and is, therefore, more practical. By using a direct proof technique not used for forward-secure before, we are able to provide better bounds original as well our scheme. Bellare Miner also presented method constructing such without use oracle. conclude by proposing an improvement their additional, new accomplishing this.