Multi-recipient Encryption in Heterogeneous Setting

This paper presents an efficient method for securely broadcasting a message to multiple recipients in a heterogeneous environment where each recipient is allowed to choose his or her preferred secure encryption scheme independently of other recipients' choices. Previous work pertinent to this direction of research, namely multi-recipient encryption scheme (MRES), generally requires all recipients adhere to the same public key encapsulation mechanism (KEM) for the sake of delivering promised savings in computation and bandwidth via randomness reuse. Our work eliminates the requirement of using the same KEM by all recipients, whereby removing a practical barrier to the adoption of MRES in real world applications. A second advantage is the method's capability to cope with a dynamically changing group of recipients where old recipients may be deleted and new recipients may be added, while ensuring the security of messages shared in future. Additional features of our method include decryption by a sender, anonymity of recipients and stateful key encapsulation which significantly reduces computational costs for securely transmitting or sharing new messages. All these attributes would be useful in building applications for secure data sharing in a cloud computing environment.

[1]  Ahmed Obied,et al.  Broadcast Encryption , 2008, Encyclopedia of Multimedia.

[2]  Yuliang Zheng,et al.  Efficient Public Key Encryption Admitting Decryption by Sender , 2012, EuroPKI.

[3]  Nigel P. Smart,et al.  Efficient Key Encapsulation to Multiple Parties , 2004, SCN.

[4]  Thomas Hardjono,et al.  The Sibling Intractable Function Family (SIFF): Notion, Construction and Applications (Special Section on Cryptography and Information Security) , 1993 .

[5]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[6]  Ronald Cramer,et al.  Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack , 2003, SIAM J. Comput..

[7]  Colin Boyd,et al.  Cryptography and Coding , 1995, Lecture Notes in Computer Science.

[8]  Aggelos Kiayias,et al.  Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.

[9]  M. Bellare,et al.  Multi-Recipient Encryption Schemes: Security Notions and Randomness Re-Use , 2003 .

[10]  David Naccache,et al.  Cryptography and Security: From Theory to Applications , 2012, Lecture Notes in Computer Science.

[11]  Marc Fischlin,et al.  Public Key Cryptography – PKC 2012 , 2012, Lecture Notes in Computer Science.

[12]  Günther Pernul,et al.  Public Key Infrastructures, Services and Applications , 2011, Lecture Notes in Computer Science.

[13]  Mihir Bellare,et al.  Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation , 2006, CCS '06.

[14]  Keisuke Tanaka,et al.  Multi-recipient Public-Key Encryption from Simulators in Security Proofs , 2009, ACISP.

[15]  Mihir Bellare,et al.  Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security , 2007, IEEE Transactions on Information Theory.

[16]  Kenneth G. Paterson,et al.  Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model , 2012, Public Key Cryptography.

[17]  Xiaoyun Wang,et al.  Public Key Encryption for the Forgetful , 2012, Cryptography and Security.

[18]  Manuel Barbosa,et al.  Randomness Reuse: Extensions and Improvements , 2007, IMACC.

[19]  Yuliang Zheng,et al.  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[20]  Yvo Desmedt.  Public Key Cryptography — PKC 2003 , 2002, Lecture Notes in Computer Science.

[21]  Blake Ramsdell,et al.  Secure/Multipurpose Internet Mail Extensions (S/MIME) Version 3.1 Message Specification , 2004, RFC.

[22]  Douglas R. Stinson,et al.  Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[23]  Information Security and Privacy , 1996, Lecture Notes in Computer Science.

[24]  Kaoru Kurosawa,et al.  Multi-recipient Public-Key Encryption with Shortened Ciphertext , 2002, Public Key Cryptography.

[25]  Mihir Bellare,et al.  Randomness Re-use in Multi-recipient Encryption Schemeas , 2003, Public Key Cryptography.

[26]  Victor Shoup,et al.  OAEP Reconsidered , 2001, CRYPTO.

[27]  Burton S. Kaliski.  Advances in Cryptology - CRYPTO '97 , 1997 .