Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Extended Notions of Security for Multicast Public Key Cryptosystems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Linear Code Implies Public-Key Traitor Tracing
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Simplified OAEP for the RSA and Rabin Functions
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding a small root of a univariate modular equation
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key encryption in a multi-user setting: security proofs and improvements
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
IEEE Transactions on Information Theory
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation
Proceedings of the 13th ACM conference on Computer and communications security
Dynamic and efficient joint encryption scheme in the plain public key model
Computers and Electrical Engineering
Efficient and Provably Secure Certificateless Multi-receiver Signcryption
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
On the Security of Provably Secure Multi-Receiver ID-Based Signcryption Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient ID-based multi-decrypter encryption with short ciphertexts
Journal of Computer Science and Technology
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Multi-recipient Public-Key Encryption from Simulators in Security Proofs
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Identity-based broadcast encryption with constant size ciphertexts and private keys
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Randomness reuse: extensions and improvements
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Generic constructions of stateful public key encryption and their applications
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Efficient broadcast encryption with personalized messages
ProvSec'10 Proceedings of the 4th international conference on Provable security
On the integration of public key data encryption and public key encryption with keyword search
ISC'06 Proceedings of the 9th international conference on Information Security
Multi-receiver identity-based key encapsulation with shortened ciphertext
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient multi-receiver identity-based encryption and its application to broadcast encryption
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Difference set attacks on conjunctive keyword search schemes
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
Multiplex encryption: a practical approach to encrypting multi-recipient emails
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Efficient and provably secure multi-receiver identity-based signcryption
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A diffie-hellman key exchange protocol without random oracles
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Oblivious conjunctive keyword search
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Public key encryption for the forgetful
Cryptography and Security
Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Public key encryption with conjunctive keyword search and its extension to a multi-user system
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Future Generation Computer Systems
Proceedings of the first ACM workshop on Asia public-key cryptography
High Performance Group Merging/Splitting Scheme for Group Key Management
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In the trivial n-recipient public-key encryption scheme, a ciphertext is a concatenation of independently encrypted messages for n recipients. In this paper, we say that an n-recipient scheme has a "shortened ciphertext" property if the length of the ciphertext is almost a half (or less) of the trivial scheme and the security is still almost the same as the underlying single-recipient scheme. We first present (multi-plaintext, multi-recipient) schemes with the "shortened ciphertext" property for ElGamal scheme and Cramer-Shoup scheme. We next show (single-plaintext, multi-recipient) hybrid encryption schemes with the "shortened ciphertext" property.