Sciweavers

77 search results - page 4 / 16
» How to Achieve a McEliece-Based Digital Signature Scheme
Sort
View
ASIACRYPT
2009
Springer
14 years 22 days 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
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 14 days 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
COMCOM
1999
73views more  COMCOM 1999»
13 years 5 months ago
Securing digital signatures for non-repudiation
Dispute of transactions is a common problem that could jeopardise business. Hence non-repudiation services are essential in business transactions which provide evidence to enable ...
Jianying Zhou, Kwok-Yan Lam
IJACT
2008
158views more  IJACT 2008»
13 years 6 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
13 years 11 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino