A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Generic Transformation to Strongly Unforgeable Signatures
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
The GPS Identification Scheme Using Frobenius Expansions
Research in Cryptology
Identity-Based Online/Offline Encryption
Financial Cryptography and Data Security
Optimal Online/Offline Signature: How to Sign a Message without Online Computation
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Efficient Batch Verification of Short Signatures for a Single-Signer Setting without Random Oracles
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Hash Functions from Sigma Protocols and Improvements to VSH
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper)
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Authenticated Adversarial Routing
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Divisible On-Line/Off-Line Signatures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
An Efficient Identity-Based Online/Offline Encryption Scheme
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
An Improved Secure Identity-Based On-Line/Off-Line Signature Scheme
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
How to Prove Security of a Signature with a Tighter Security Reduction
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Twin Signature Schemes, Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Short generic transformation to strongly unforgeable signature in the standard model
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Journal of Network and Computer Applications
A short signature scheme from the RSA family
ISC'10 Proceedings of the 13th international conference on Information security
Decoupling the design of identifier-to-locator mapping services from identifiers
Computer Networks: The International Journal of Computer and Telecommunications Networking
One-time signatures and Chameleon hash functions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Identity-based online/offline key encapsulation and encryption
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Generic transformation from weakly to strongly unforgeable signatures
Journal of Computer Science and Technology
Tight proofs for signature schemes without random oracles
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Controversy corner: Improving security of q-SDH based digital signatures
Journal of Systems and Software
Online/offline verification of short signatures
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Efficient online/offline signatures with computational leakage resilience in online phase
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Securing location-aware services based on online/offline signatures in VANETs
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
Short and efficient certificate-based signature
NETWORKING'11 Proceedings of the IFIP TC 6th international conference on Networking
General construction of chameleon all-but-one trapdoor functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
Identity based online/offline encryption and signcryption schemes revisited
InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
New approach for selectively convertible undeniable signature schemes
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
General conversion for obtaining strongly existentially unforgeable signatures
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient designated confirmer signatures without random oracles or general zero-knowledge proofs
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
How to authenticate real time streams using improved online/offline signatures
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
New signature schemes with coupons and tight reduction
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
On the key exposure problem in chameleon hashes
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
On tolerant cryptographic constructions
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
An efficient CDH-based signature scheme with a tight security reduction
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Generic on-line/off-line threshold signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
New online/offline signature schemes without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
The power of identification schemes
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
VSH, an efficient and provable collision-resistant hash function
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A practical and tightly secure signature scheme without hash function
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
How to strengthen any weakly unforgeable signature into a strongly unforgeable signature
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Online/Offline ring signature scheme
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Energy-Efficient cryptographic engineering paradigm
iNetSec'11 Proceedings of the 2011 IFIP WG 11.4 international conference on Open Problems in Network Security
Generic security-amplifying methods of ordinary digital signatures
Information Sciences: an International Journal
Efficient multiple-collision trapdoor hash family
Security and Communication Networks
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A pre-computable signature scheme with efficient verification for RFID
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Mutual authentication and group key agreement for low-power mobile devices
Computer Communications
Strong security from probabilistic signature schemes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Space efficient signature schemes from the RSA assumption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Public key encryption against related key attacks
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
A Further Improved Online/Offline Signature Scheme
Fundamenta Informaticae
Security and Communication Networks
Efficient ID-based non-malleable trapdoor commitment
Computers and Electrical Engineering
Fully anonymous attribute tokens from lattices
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Efficient self-certified signatures with batch verification
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Security enhancement of identity-based identification with reversibility
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Selective opening chosen ciphertext security directly from the DDH assumption
NSS'12 Proceedings of the 6th international conference on Network and System Security
Efficient and robust identity-based handoff authentication in wireless networks
NSS'12 Proceedings of the 6th international conference on Network and System Security
ETA: efficient and tiny and authentication for heterogeneous wireless systems
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Privacy-preserving smart metering with regional statistics and personal enquiry services
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Efficient online/offline signcryption without key exposure
International Journal of Grid and Utility Computing
LAKE: A Server-Side Authenticated Key-Establishment with Low Computational Workload
ACM Transactions on Internet Technology (TOIT)
An ID-based online/offline signature scheme without random oracles for wireless sensor networks
Personal and Ubiquitous Computing
Software Service Signature (S3) for authentication in cloud computing
Cluster Computing
| Hi-index | 0.00 |
The notion of on-line/off-line signature schemes was introduced in 1990 by Even, Goldreich and Micali. They presented a general method for converting any signature scheme into an on-line/off-line signature scheme, but their method is not very practical as it increases the length of each signature by a quadratic factor. In this paper we use the recently introduced notion of a trapdoor hash function to develop a new paradigm called hash-sign-switch, which can convert any signature scheme into a highly efficient on-line/off-line signature scheme: In its recommended implementation, the on-line complexity is equivalent to about 0:1 modular multiplications, and the size of each signature increases only by a factor of two. In addition, the new paradigm enhances the security of the original signature scheme since it is only used to sign random strings chosen off-line by the signer. This makes the converted scheme secure against adaptive chosen message attacks even if the original scheme is secure only against generic chosen message attacks or against random message attacks.