5,266 research outputs found

    ASPECT-BASE PROXY-ORIENTED INFORMATION SAVING AND DISTANT DATA RELIABILITY VERIFICATION IN CLOUD

    Get PDF
    This paper is dependent on the study outcomes of proxy cryptography, identity-based public key cryptography and remote data integrity checking in public places cloud. In public places cloud, this paper concentrates on the identity-based proxy-oriented data uploading and remote data integrity checking. By utilizing identity-based public key cryptology, our suggested ID-PUIC protocol is efficient because the certificate management is eliminated. ID-PUIC is really a novel proxy-oriented data uploading and remote data integrity checking model in public places cloud. Using the public cloud platform, the customers are relieved from the burden for storage management, universal data access with independent geographical locations, etc. Throughout analysis, the manager is going to be limited to connect to the network to be able to guard against collusion. But, the manager’s legal business will go on throughout analysis. We provide the formal system model and security model for ID-PUIC protocol. Then, in line with the bilinear pairings, we designed the very first concrete ID-PUIC protocol. Within the random oracle model, our designed ID-PUIC protocol is provably secure. However, the suggested ID-PUIC protocol may also realize private remote data integrity checking, delegated remote data integrity checking and public remote data integrity checking in line with the original client’s authorization

    Still Wrong Use of Pairings in Cryptography

    Get PDF
    Several pairing-based cryptographic protocols are recently proposed with a wide variety of new novel applications including the ones in emerging technologies like cloud computing, internet of things (IoT), e-health systems and wearable technologies. There have been however a wide range of incorrect use of these primitives. The paper of Galbraith, Paterson, and Smart (2006) pointed out most of the issues related to the incorrect use of pairing-based cryptography. However, we noticed that some recently proposed applications still do not use these primitives correctly. This leads to unrealizable, insecure or too inefficient designs of pairing-based protocols. We observed that one reason is not being aware of the recent advancements on solving the discrete logarithm problems in some groups. The main purpose of this article is to give an understandable, informative, and the most up-to-date criteria for the correct use of pairing-based cryptography. We thereby deliberately avoid most of the technical details and rather give special emphasis on the importance of the correct use of bilinear maps by realizing secure cryptographic protocols. We list a collection of some recent papers having wrong security assumptions or realizability/efficiency issues. Finally, we give a compact and an up-to-date recipe of the correct use of pairings.Comment: 25 page
    • …
    corecore