Generic transformation from broadcast encryption to round-optimal deniable ring authentication

DOI10.1007/S10623-021-00975-4MaRDI QIDQ2115719zbMATHOpenAlexWikidataFDO

Authors Keisuke Hara, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka

Publication date 21 March 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-021-00975-4

zbMATH Keywords

random oracle modelbroadcast encryptiondeniable ring authenticationplaintext awareness

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Applied Cryptography and Network Security
• Information Security and Cryptology - ICISC 2003
• scientific article; zbMATH DE number 1942439
• Topics in Cryptology – CT-RSA 2006
• Deniable ring authentication based on projective hash functions

Cites work

• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• scientific article; zbMATH DE number 1341866 (Why is no real title available?)
• scientific article; zbMATH DE number 1024079 (Why is no real title available?)
• scientific article; zbMATH DE number 1942439 (Why is no real title available?)
• scientific article; zbMATH DE number 2009957 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - CRYPTO 2003
• An algebraic framework for Diffie-Hellman assumptions
• Applied Cryptography and Network Security
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Deniable ring authentication based on projective hash functions
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Improved dual system ABE in prime-order groups via predicate encodings
• Information Security and Cryptology - ICISC 2003
• New approaches for deniable authentication
• Obfuscating simple functionalities from knowledge assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• Optimal broadcast encryption from LWE and pairings in the standard model
• Optimal broadcast encryption from pairings and LWE
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• Tight adaptively secure broadcast encryption with short ciphertexts and keys
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• Verifiable predicate encryption and applications to CCA security and anonymous predicate authentication

This page was built for publication: Generic transformation from broadcast encryption to round-optimal deniable ring authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115719)