Sciweavers

CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 6 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
CCS
2007
ACM
14 years 6 months ago
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
Alexandra Boldyreva, Craig Gentry, Adam O'Neill, D...
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
14 years 6 months ago
Generic Transformation to Strongly Unforgeable Signatures
Recently, there are several generic transformation techniques proposed for converting unforgeable signature schemes (the message in the forgery has not been signed yet) into strong...
Qiong Huang, Duncan S. Wong, Yiming Zhao
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 6 months ago
Light-Weight Fair-Dealing Infrastructures (FADIS) for M-Commerce
Abstract— An important issue in mobile commerce (mcommerce) is to exchange digital data between two distributed parties in an efficient and fair manner. In this paper, a lightwe...
Huafei Zhu, Feng Bao
CISIM
2007
IEEE
14 years 6 months ago
Universally Composable Key-Evolving Signature
The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving...
Jin Zhou, Yuefei Zhu, TingMao Chang, YaJuan Zhang
AFRICACRYPT
2008
Springer
14 years 6 months ago
Cryptanalysis of the TRMS Signature Scheme of PKC'05
In this paper, we investigate the security of the Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC’05. To do so, we present a hybrid approach for so...
Luk Bettale, Jean-Charles Faugère, Ludovic ...
PROVSEC
2009
Springer
14 years 6 months ago
Anonymous Signatures Revisited
Abstract. We revisit the notion of the anonymous signature, first formalized by Yang, Wong, Deng and Wang [12], and then further developed by Fischlin [6] and Zhang and Imai [13]. ...
Vishal Saraswat, Aaram Yun
ASIACRYPT
2009
Springer
14 years 6 months ago
Signature Schemes with Bounded Leakage Resilience
A leakage-resilient cryptosystem remains secure even if arbitrary, but bounded, information about the secret key (or possibly other internal state information) is leaked to an adv...
Jonathan Katz, Vinod Vaikuntanathan
ASIACRYPT
2009
Springer
14 years 6 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
DCC
2005
IEEE
14 years 11 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee