China 
Africa 
Explore chapters and articles related to this topic
Hash Functions and Applications
Published in Jonathan Katz, Yehuda Lindell, Introduction to Modern Cryptography, 2020
A popular example of this approach is the random-oracle model, which treats a cryptographic hash function H as a truly random function. (We have already seen an example of this in our discussion of birthday attacks, although there we were analyzing an attack rather than a construction.) More specifically, the random-oracle model posits the existence of a public, random function H that can be evaluated only by “querying” an oracle—which can be thought of as a “black box”—that returns H(x) when given input x. (We will discuss how this is to be interpreted in the following section.) To differentiate things, the model we have been using until now (where no random oracle is present) is sometimes called the “standard model,” although at this point the random-oracle model itself is considered quite standard in the literature.
A verifiable and cheating-resistant secret sharing scheme
Published in Debatosh Guha, Badal Chakraborty, Himadri Sekhar Dutta, Computer, Communication and Electrical Technology, 2017
Arup Kumar Chattopadhyay, Amitava Nag, Koushik Majumder
Random oracle model was established in 1993 by M. Bellare and P. Rogaway. In this paradigm, authors stated that a practical protocol is produced by first devising and providing a protocol for random oracle model and then replacing the random oracle by appropriate hash function. The authors argued that this paradigm yields protocols that are more efficient than the standard ones and is applicable for encryption, signatures, and zero-knowledge proof.
Blockchain-based anonymous authentication for traffic reporting in VANETs
Published in Connection Science, 2022
Random oracle model (ROM) is proposed by Bellare and Rogaway (1993) for analysing the security of cryptographic scheme. The principle of ROM is given an algorithm A, construct a new algorithm C, C can solve the corresponding mathematical problems according to A. When A queries C, C answers the question with the help of oracle. Hash function is usually used to imitate random oracle. For a new query, the hash function generates a new answer and return the answer to the inquirer. Otherwise, it responses the same answer for repeat queries. Hash functions that satisfy the following conditions can be used as random oracle:
Zero-Knowledge Proof Intelligent Recommendation System to Protect Students’ Data Privacy in the Digital Age
Published in Applied Artificial Intelligence, 2023
The random oracle model, a common framework for analyzing cryptographic schemes, assumes the existence of an idealized random oracle that produces unpredictable and unique outputs for each input. This model allows for a more tractable analysis of the security properties of cryptographic constructions.
Advanced multi-factor user authentication scheme for E-governance applications in smart cities
Published in International Journal of Computers and Applications, 2019
The concept of smart city is rapidly gaining momentum and focuses on improving the quality of life of citizens by adopting ICT. Now, the government is initiating new projects for the benefit of the citizenry with a set-up of minimum manpower aimed at low functional cost, better proficiency and speedy delivery of services. The citizenry avail these facilities given by the government with ease, in a convenient way and transparently [10]. With the advancement of ICT, information has emerged as an easily accessible but a crucial aspect. The intruders endeavor to breach data in the transmission of the E-governance system and intensify their access to fulfill their malevolent aim. The security analysts face severe challenges to allow only legitimate entities to access public services and to prevent the illegitimate access to these facilities. As the communication between the user and the government server takes place in an insecure public channel, user authentication is of utmost importance. Authentication schemes aim to guarantee the legitimacy of the user. The authentication schemes proposed in the literature for secure communication between citizens and the government are not completely resistant against security threats. Also, schemes are unsuitable as they are not lightweight and computationally inefficient for the resource constrained environment. The scheme should be highly secure to ensure only legitimate user gets access to the resource. Motivated by this, this paper proposes a robust and efficient user authentication scheme. The major contributions of this paper are as follows:A secure and efficient user authentication scheme for smart card based E-governance during Citizen-to-Government (C2G) type of E-governance transactions.A robust, lightweight scheme secure against multiple security attacks. It also satisfies all the desired essential attributes of security.A formal verification performed using AVISPA tool confirms the security of our scheme. The informal security analysis has also been discussed.A security analysis of the proposed scheme is performed using random oracle. The analysis confirms the security against the attackers.A comparative analysis of the proposed scheme with other related schemes is performed. The analysis shows that the proposed scheme is computationally efficient than the schemes proposed in the literature.