REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Improved Online/Offline Signature Schemes
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 11th ACM conference on Computer and communications security
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Journal of Cryptology
General Ad Hoc Encryption from Exponent Inversion IBE
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Identity-Based Online/Offline Encryption
Financial Cryptography and Data 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
Removing Escrow from Identity-Based Encryption
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
An Efficient Identity-Based Online/Offline Encryption Scheme
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Practical ID-based encryption for wireless sensor network
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
A closer look at PKI: security and efficiency
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Off-line/on-line signatures: theoretical aspects and experimental results
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Secure mobile subscription of sensor-encrypted data
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Server-aided signatures verification secure against collusion attack
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
New privacy-preserving architectures for identity-/attribute-based encryption
New privacy-preserving architectures for identity-/attribute-based encryption
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
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
Online/Offline ring signature scheme
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Security proof of sakai-kasahara's identity-based encryption scheme
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Secure mobile subscription of sensor-encrypted data
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Server-aided signatures verification secure against collusion attack
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Identity-based server-aided decryption
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Exclusion-intersection encryption
International Journal of Security and Networks
Server-aided signatures verification secure against collusion attack
Information Security Tech. Report
| Hi-index | 0.00 |
An identity-based online/offline encryption (IBOOE) scheme splits the encryption process into two phases. The first phase performs most of the heavy computations, such as modular exponentiation or pairing over points on elliptic curve. The knowledge of the plaintext or the receiver's identity is not required until the second phase, where the ciphertext is produced by only light computations, such as integer addition/multiplication or hashing. This division of computations makes encryption affordable by devices with limited computation power since the preparation works can be executed "offline" or possibly by some powerful devices. The identity-based (ID-based) nature of the scheme also allows the preparation of ciphertext without certificate verification. Since efficiency is the main concern, less burden in the computation requirements of all phases (i.e., both phases of encryption and the decryption phase) and smaller ciphertext size are desirable. In this paper, we propose new schemes with improved efficiency over previous schemes by assuming random oracles. Our first construction is a very efficient scheme secure against chosen-plaintext attack (CPA), which is just slightly modified from an existing scheme. We then proceed to propose a new notion called ID-based Online/Offline KEM (IBOOKEM) that allows the key encapsulation process to be split into offline and online stages, in the same way as IBOOE does. We also present a generic transformation to get security against chosen-ciphertext attack (CCA) for IBOOE from any IBOOKEM scheme with one-wayness only. Our schemes (both CPA and CCA) are the most efficient one in the state-of-the-art, in terms of online computation and ciphertext size, which are the two main focuses of online/offline schemes. Our schemes are very suitable to be deployed on embedded devices such as smartcard or wireless sensor which have very limited computation powers and the communication bandwidth is very expensive.