Sciweavers

AINA
2006
IEEE
13 years 8 months ago
Efficient Authentication for Reactive Routing Protocols
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
Raghav Bhaskar, Javier Herranz, Fabien Laguillaumi...
ASIACRYPT
2000
Springer
13 years 9 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
ASIACRYPT
2000
Springer
13 years 9 months ago
A New Forward-Secure Digital Signature Scheme
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
Michel Abdalla, Leonid Reyzin
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
CCS
2003
ACM
13 years 10 months ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
13 years 10 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi
ISW
2004
Springer
13 years 10 months ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ISW
2004
Springer
13 years 10 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz
ICICS
2004
Springer
13 years 10 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
ESORICS
2004
Springer
13 years 10 months ago
Signature Bouquets: Immutability for Aggregated/Condensed Signatures
Database outsourcing is a popular industry trend which involves organizations delegating their data management needs to an external service provider. In this model, a service prov...
Einar Mykletun, Maithili Narasimha, Gene Tsudik