Explore chapters and articles related to this topic
Towards Preserving Privacy and Security in Blockchain
Published in Kuan-Ching Li, Xiaofeng Chen, Hai Jiang, Elisa Bertino, Essentials of Blockchain Technology, 2019
Mohammad Mustafa Helal, Muhammad Rizwan Asghar
Unlike Bitcoin, the funds are not associated with the public address. When users send funds, they actually send funds to a random newly created one-time destination address. Hence, neither public records of the sender nor the receiver will appear in a public record. Instead, Monero uses a stealth address concept to hide the recipient address. To generate a stealth address, a Monero user is associated with two key pairs. One is a secret key pair (secret viewing key as skv and secret spending key as sks) known only by the user and a second public key pair is publicly shared (public viewing key as pkv and public spending key as pks). A stealth address is a new address derived from a one-time public key generated by the sender on behalf of their intended receiver. Hence, any transaction is always marked by a unique destination address. A sender generates a stealth address by two species of information: first is a random number used to generate a shared secret known only by both parties, while second is the public key pair of the receiver. The shared secret is generated through a Diffie-Hellman exchange. On the receiver end, Monero user actively scans the network to listen to every transaction, detects if the transaction is intended for their recipient’s address, and then recovers the private key associated with this one-time public key in order to spend the funds.
Key Establishment Protocols
Published in Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, 2018
Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone
Key establishment protocols result in shared secrets which are typically called, or used to derive, session keys. Ideally, a session key is an ephemeral secret, i.e., one whose use is restricted to a short time period such as a single telecommunications connection (or session), after which all trace of it is eliminated. Motivation for ephemeral keys includes the following: to limit available ciphertext (under a fixed key) for cryptanalytic attack;to limit exposure, with respect to both time period and quantity of data, in the event of (session) key compromise;to avoid long-term storage of a large number of distinct secret keys (in the case where one terminal communicates with a large number of others), by creating keys only when actually required;to create independence across communications sessions or applications.
Wireless Security Wi-Fi
Published in Ali Youssef, Douglas McDonald II, Jon Linton, Bob Zemke, Aaron Earle, Wi-Fi Enabled Healthcare, 2014
Ali Youssef, Douglas McDonald II, Jon Linton, Bob Zemke, Aaron Earle
RADIUS stands for Remote Authentication Dial-In User Service; this protocol is used in network environments for authentication, authorization, and accounting. RADIUS can run across many types of devices such as routers, servers, switches, modems, VPN concentrators, or any other type of RADIUS-compliant device. thhe protocol works by creating an encrypted tunnel between the network device and RADIUS server. This tunnel is used for sending all the authentication, authorization, and accounting (AAA) information about who a user is, where they’re allowed to go, and where they actually did go. In order to start this encrypted tunnel, a phrase or password called the shared secret is needed. The shared secret is located on the RADIUS participating network device and the RADIUS server. Once the shared secret is correctly set up secure communication can take place.
Secure android IoT mobile and collaborative machine learning for controlling the management of enterprise
Published in Journal of Control and Decision, 2022
Hamza Mohammed Ridha Al-Khafaji, Refed Adnan Jaleel
By exchanging data over a public network, Diffie��Hellman creates a shared secret that can be utilised for secret communications. Instead of utilising a big amount of numbers, the following diagram depicts the crucial exchange in broad strokes. When Alice and Bob trade their secret colours in a mix, the process is complete. And finally, this generates an identical key that is mathematically tough (impossible for contemporary supercomputers to achieve within reasonable time) to reverse for a third party who might have been listening in on their conversations. This shared secret is now used by Alice and Bob to encrypt and decrypt their data sent and received. Alice and Bob have already settled on the yellow paint. It is possible for two parties to exchange public and private keys using the Diffie–Hellman algorithm. Alice and Bob can work together offline to generate a shared secret once they have authentic copies of each other's public keys. For example, a symmetric cipher can use the shared secret as the key (Dohare et al., 2022; Khan et al., 2021; Thirumalai et al., 2020). Figure 4 shows Diffie–Hellman exchange.