A new strong (t, N)-key-insulated public-key encryption scheme based on the CDH assumption is proposed according to the (t, N)-key-insulated public-key encryption model and security definition presented by Yevgeniy-Jonathan-Moti. The new scheme has been proved against chosen-cipertext attack in random oracle.
Accurate class invariant and method post-condition can act as a test oracle. At the same time, and class invariant and method precondition can act as the inputs of partitioning equivalence class and analyzing boundary values.
In the process of Diffie-Hellman key agreement, if there was an oracle OF,∈ and a polynomial F(X) such that given rx and ry, it output F(rxy)with probability at least ε (0), otherwise it gave the wrong messages, then one could compute the secrete keys in all cases.
Then,we provide some theoretical discussions for the security model for MVESSs,and show that our new scheme can be proven to secure with the hardness assumption of the computational Diffie-Hellman problem of pairings in the random oracle model.
We also give an ID-based deniable ring authentication based on bilinear pairings, which is proved to be secure in the random oracle model.
A relational database has been formed under the control of the Database Management System (DBMS) Oracle 8.
Most importantly, the proposed scheme has been proven to be tightly semantically secure under adaptive chosen ciphertext attacks (IND-CCA2) and to provide integrity of ciphertext (INT-CTXT) as well as non-repudiation in the random oracle model.
We also prove that our scheme is chosen message and ID secure in the random oracle model, assuming the hardness of factoring.
This letter presents an anonymous off-line electronic payment model with multiple issuing-banks and gives an implementation scheme based on the discrete logarithm problem and the random oracle model.