A CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles

Informatica ◽  
2015 ◽  
Vol 26 (3) ◽  
pp. 543-556
Author(s):  
Shengbao Wang ◽  
Peng Zeng ◽  
Kim-Kwang Raymond Choo ◽  
Hongbing Wang
Keyword(s):  
Encryption Scheme ◽  
Random Oracles

scholarly journals A Pairing-Based Three-Party Authenticated Encryption Scheme without Shared Secrets

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 605
Author(s):  
Han-Yu Lin
Keyword(s):  
Computational Efficiency ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Random Oracles ◽  
Comparison Results ◽  
Communication Environments ◽  
Single User ◽  
Designated Verifier

The Traditional Authenticated Encryption (AE) scheme is a single-user cryptographic mechanism which only enables one designated verifier to authenticate the ciphertext. Although several group-oriented AE variants have also been proposed to eliminate such a limitation, they require shared verification. This motivated us to think of a scenario of three-party communication environments where each party runs independent processes without cooperation. In this paper, we realize a novel three-party AE (abbreviated to TPAE) scheme in which two designated verifiers can solely decrypt the same ciphertext and then inspect the validity of embedded signature. Additionally, we also show that our TPAE construction is computationally secure using the well-defined IND-CCA2 and the EF-CMA adversary games in the proof model of random oracles. The comparison results will demonstrate the computational efficiency of our mechanism.

scholarly journals Verifiable Encryption and Applications to Group Signatures and Signature Sharing

1998 ◽  
Vol 5 (32) ◽  
Author(s):  
Jan Camenisch ◽  
Ivan B. Damgård
Keyword(s):  
Digital Signatures ◽  
Encryption Scheme ◽  
Random Oracles ◽  
Group Signatures ◽  
Wide Range ◽  
Encryption Schemes ◽  
Verifiable Encryption

We generalise and improve the security and efficiency of the verifiable encryption scheme of Asokan et al., such that it can rely on more general assumptions, and can be proven secure without relying on random oracles. We show a new application of verifiable encryption to group signatures with separability, these schemes do not need special purpose keys but can work with a wide range of signature and encryption schemes already in use. Finally, we extend our basic primitive to verifiable threshold and group encryption. By encrypting digital signatures this way, one gets new solutions to the verifiable signature sharing problem.

Cryptanalysis of an identity based broadcast encryption scheme without random oracles

2011 ◽  
Vol 111 (10) ◽  
pp. 461-464 ◽  
Author(s):  
Xu An Wang ◽  
Jian Weng ◽  
Xiaoyuan Yang ◽  
Yanjiang Yang
Keyword(s):  
Broadcast Encryption ◽  
Encryption Scheme ◽  
Random Oracles ◽  
Identity Based

HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES

2010 ◽  
Vol 21 (06) ◽  
pp. 1049-1063 ◽  
Author(s):  
YANLI REN ◽  
DAWU GU ◽  
SHUOZHONG WANG ◽  
XINPENGU ZHANG
Keyword(s):  
Identity Authentication ◽  
Public Key ◽  
Key Generation ◽  
Encryption Scheme ◽  
Number Of Solutions ◽  
Organizational Hierarchy ◽  
Private Key ◽  
Random Oracles ◽  
Identity Based Encryption ◽  
Identity Based

In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy, which allows a root private key generator to distribute the workload by delegating private key generation and identity authentication to lower-level private key generators. In this paper, we propose a hierarchical identity-based proxy re-encryption (HIBPRE) scheme which achieves IND-PrID-CCA2 security without random oracles. This is the first HIBPRE scheme up to now, and our scheme satisfies unidirectionality, non-interactivity and permits multiple re-encryptions.

Cryptanalysis on an Improved Version of ElGamal-Like Public-Key Encryption Scheme for Encrypting Large Messages

Informatica ◽  
2012 ◽  
Vol 23 (4) ◽  
pp. 537-562 ◽  
Author(s):  
Ting-Yi Chang ◽  
Min-Shiang Hwang ◽  
Wei-Pang Yang
Keyword(s):  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption

Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function

2016 ◽  
Vol E99.B (9) ◽  
pp. 2108-2111
Author(s):  
Minkyu KIM ◽  
Je HONG PARK ◽  
Dongyoung ROH
Keyword(s):  
Random Function ◽  
Encryption Scheme
Sign in / Sign up

Export Citation Format

Share Document