DOCSLIB.ORG

Approximate Bitcoin Mining

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Approximate Bitcoin Mining Approximate Bitcoin Mining Matthew Vilim Henry Duwe Rakesh Kumar University of Illinois at University of Illinois at University of Illinois at Urbana-Champaign Urbana-Champaign Urbana-Champaign [email protected] [email protected] [email protected] ABSTRACT Bitcoin resolves this problem and guarantees consensus of Bitcoin is the most popular cryptocurrency today. A bedrock ownership by maintaining a public ledger (Section 2.1) of all of the Bitcoin framework is mining, a computation intensive transactions, called the blockchain [11]. New transactions process that is used to verify Bitcoin transactions for profit. are grouped together and are checked against the existing We observe that mining is inherently error tolerant due to its history to ensure all new transactions are valid. embarrassingly parallel and probabilistic nature. We exploit Bitcoin's authenticity is assured by those who contribute this inherent tolerance to inaccuracy by proposing approxi- computation power to its network (known as miners) to ver- mate mining circuits that trade off reliability with area and ify and append transactions to a public ledger. Miners' will- delay. These circuits can then be operated at Better Than ingness to lend their computation power to the network, typ- Worst-Case (BTWC) to enable further gains. Our results ically in the form of ASICs dedicated to mining, in exchange show that approximation has the potential to increase min- for reward (profit) is critical to the security and survival of ing profits by 30%. Bitcoin. In this paper, we observe that Bitcoin mining is a suitable candidate for approximate computing. As we demonstrate, CCS Concepts Bitcoin mining is intrinsically resilient to errors; its parallel •Hardware ! Fault tolerance; nature minimizes the propagation of errors incurred while searching for a solution, and Bitcoin's distributed verifica- tion system detects and invalidates any potentially erroneous Keywords solutions. As such, a Bitcoin mining ASIC can be built out Bitcoin; SHA-256; Approximate Computing; Error-Tolerance of approximate circuits that trade off circuits' reliability for reduced delay and area; an appropriate approximate circuit 1. INTRODUCTION will maximize profit even when producing results that are not guaranteed to be correct. The Bitcoin cryptocurrency provides a decentralized and We propose two forms of approximation. Functional ap- distributed method of verifying monetary transactions be- proximation is performed by replacing circuits with approx- tween trustless parties1. Although cryptocurrencies had been imate versions to reduce area or delay. The reclaimed tim- proposed previously, Bitcoin was the first to provide a truly ing slack may then be used to raise frequency and increase trustless solution. Unlike a traditional monetary system throughput. Operational approximation is performed by re- which is issued and backed by a single entity, Bitcoin requires ducing guard bands and running the circuit with negative no central administrator nor trust between participants. timing slack (i.e. at an even higher frequency), allowing occa- Traditionally, the difficulty in creating a distributed cur- sional timing failures and Better Than Worst-Case (BTWC) rency is the need for a scheme to prevent double spending. operation. Our results show a 30% increase in mining profit One party might simultaneously broadcast two transactions, from these approximation techniques. sending the same coins to two separate parties on the net- work; but without a central server to arbitrate both transac- tions and decide which is valid, disagreement arises over the 2. BITCOIN MINING true history and ownership of a given coin. Created in 2008, 2.1 Overview 1At the time of this writing, Bitcoin's market capitalization is $5.5 billion USD. To maintain the validity of transactions in the Bitcoin network, there must be an incentive to contribute to verify- ing transactions within the blockchain. Bitcoin provides this Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed incentive by rewarding miners who contribute with new bit- for profit or commercial advantage and that copies bear this notice and the full cita- coins for every block created. Without miners, new transac- tion on the first page. Copyrights for components of this work owned by others than tions cannot be added to the public ledger, and Bitcoin will ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or re- publish, to post on servers or to redistribute to lists, requires prior specific permission not function. The mining process is summarized in Figure 1. and/or a fee. Request permissions from [email protected]. Mining consists of searching for a cryptographic nonce value DAC ’16, June 05-09, 2016, Austin, TX, USA within a block such that the hash of the block falls within a c 2016 ACM. ISBN 978-1-4503-4236-0/16/06. $15.00 certain range. The network scales the range to maintain an DOI: http://dx.doi.org/10.1145/2897937.2897988 average rate of one new block every ten minutes. • Σ0(x) ≡ x o 2 ⊕ x o 13 ⊕ x o 22 Figure 1: Mining Process Block Diagram • Σ (x) ≡ x 6 ⊕ x 11 ⊕ x 25 block header 1 o o o • σ (x) ≡ x 7 ⊕ x 18 ⊕ x 3 nonce 0 o o • σ1(x) ≡ x o 17 ⊕ x o 19 ⊕ x 10 H(0) SHA-256 SHA-256 threshold Algorithm 2 SHA-256 1: function SHA-256(M) digest SHA-256 comparator 2: for i from 0 to N − 1 do 3: for j from 0 to 15 do (i) solution? 4: Wj = Mj 5: end for 6: for j from 16 to 63 do As a result, miners naturally compete against each other 7: Wj = σ1(Wj−2) + Wj−7 + σ0(Wj−15) + Wj−16 to gain a higher fraction of the network's hash rate in or- 8: end for der to maximize reward. In a race to capture the network's rewards, miners have developed increasingly sophisticated 9: for j from 0 to 63 do solutions, culminating in the development of Bitcoin ASIC 10: t0 h + Σ1(e) + Ch(e; f; g) + Kj + Wj accelerators [13]. A miner's revenue is determined by the 11: t1 Σ0(a) + Maj(a; b; c) accelerator's hash rate (GHash=s); operating costs are de- 12: h g; g f; f e; e d + t1 termined by its energy efficiency (GHash=J). 13: d c; c b; b a; a t1 + t2 The mining algorithm is shown in Algorithm 1. In short, (i) (i−1) (i) (i−1) mining is a search for the nonce value that results in a double 14: H0 H0 + a; H1 H1 + b SHA-256 hash digest (Algorithm 2) value less than a given (i) (i−1) (i) (i−1) 15: H2 H2 + c; H3 H3 + d threshold. The nonce is a 32-bit field within a 1024-bit block 16: H(i) H(i−1) + e; H(i) H(i−1) + f header. In order to verify transactions at a steady rate, 4 4 5 5 17: H(i) H(i−1) + g; H(i) H(i−1) + h this threshold varies over time as a function of difficulty 6 6 7 7 18: end for D(t). Difficulty is adjusted by the network regularly such 19: end for that a solution is expected to be found approximately every 20: return H(N−1) 10 minutes, regardless of the network's collective hash rate. 21: end function By their very nature, hash functions are designed to be non-invertible, so mining is performed by brute force, guess- ing nonce values and comparing the hash output. This task is perfectly parallel as multiple hashes may be computed at 2.2 Related Work once. It follows that one's probability of finding a solution Although some work has been done to improve the per- is proportional to one's hash rate. The first miner to find a formance of SHA-256 ASICs in context of other applica- valid nonce broadcasts the value on the network for verifica- tions [6] [10], no published research, to the best of our knowl- tion and is rewarded with newly minted digital (bit)coins. edge, attempts to optimize ASICs for Bitcoin mining. The most closely related work is by Courtois et al. [5] who ex- Algorithm 1 Mining Process plore mining optimizations from an algorithmic perspective. 1: nonce 0 Their central observation is that the first half of the block 2: while nonce < 232 do header (shown in gray in Figure 1) does not change across 3: threshold ((216 − 1) 208)=D(t) nonce iterations, so its hash may be precomputed. Since 32 4: digest SHA-256(SHA-256(header)) this precomputation cost is amortized across 2 nonce iter- 5: if digest < threshold then ations, it halves the cost of the first SHA-256 round (shown 6: return nonce within the dashed line in Figure 1). Our paper is the first 7: else work to explore hardware optimizations, specifically approx- 8: nonce nonce + 1 imation-based optimizations theorized by [8], unique to Bit- 2 9: end if coin mining . 10: end while 2.3 Baseline Hardware Algorithm 2 presents a basic description of SHA-256. For 2.3.1 Implementation details on message padding, initial hash values H(0), and For our studies, we selected as baseline the SHA-256 ASIC constants Kj , see [12]. design outlined by Dadda et al. [6]. A summary of SHA-256 • The message M is divided into N 512-bit blocks is provided in Algorithm 2. The hashing core in this design is M (0);M (1);:::;M (N−1). Each of these blocks is fur- implemented as two parallel pipelines, the Compressor (Line ther subdivided into 16 32-bit words M (i);M (i);:::;M (i).
Load more

Recommended publications
  • Implementation and Analysis of Key Reinstallation Attack
    International Journal of Innovations in Engineering and Technology (IJIET) http://dx.doi.org/10.21172/ijiet.133.21 Implementation and Analysis of Key Reinstallation Attack Saba Khanum1, Ishita kalra2 1Department of Information Technology, MSIT, Janakpuri, New Delhi, India 2Department of Computer Science and Engineering, MSIT, Janakpuri, New Delhi, India Abstract- The objective of the paper is to implement and analyzed the impact of Key Reinstallation Attack (popularly dubbed as KRACK) on debian based machines. The paper elucidates on the capture of packets through the attack without being a part of the network and affecting the target machines with the help of an attack machine placed inside the network. It basically exploits the nonce of the network which ultimately paves way to the execution of the attack. The issue tends to gather more eyeballs as it affects all devices using Wi-Fi through WPA2 protocol. Hence, the catastrophe complimented along the attack is severe. The analysis of the impact is carried on by analyzing the type of packets visible as well as captured during the course of the implementation. Here, we have created a python script which identifies whether the targeted machine is vulnerable to KRACK or not and corresponding to that the packet capture starts and ultimately, the impact is measured. Keywords – KRACK, weakness, WPA2, attack, security I. INTRODUCTION The presence of the bug has been detected in the cryptographic nonce of the WPA2 and can be used to clone a connected party to reinstall a used key. The presence of the nonce is specifically intended to prevent reuse, but in this particular case, it gives malicious users the opportunity to replay, decrypt, or forge packets, ultimately enabling them to access all previously considered encrypted information without actually being part of the network.
    [Show full text]
  • Authenticated Encryption Mode IAPM Using SHA-3'S Public Random
    Authenticated Encryption Mode IAPM using SHA-3’s Public Random Permutation Charanjit Jutla IBM T. J. Watson Research Center New York 10598 Abstract. We study instantiating the random permutation of the block- cipher mode of operation IAPM (Integrity-Aware Parallelizable Mode) with the public random permutation of Keccak, on which the draft stan- dard SHA-3 is built. IAPM and the related mode OCB are single-pass highly parallelizable authenticated-encryption modes, and while they were originally proven secure in the private random permutation model, Kurosawa has shown that they are also secure in the public random per- mutation model assuming the whitening keys are uniformly chosen with double the usual entropy. In this paper, we show a general composabil- ity result that shows that the whitening key can be obtained from the usual entropy source by a key-derivation function which is itself built on Keccak. We stress that this does not follow directly from the usual indifferentiability of key-derivation function constructions from Random Oracles. We also show that a simple and general construction, again employing Keccak, can also be used to make the IAPM scheme key- dependent-message secure. Finally, implementations on modern AMD-64 architecture supporting 128-bit SIMD instructions, and not supporting the native AES instructions, show that IAPM with Keccak runs three times faster than IAPM with AES. 1 Introduction Symmetric key encryption of bulk data is usually performed using either a stream cipher or a block cipher. A long message is divided into small fixed-size blocks and encryption is performed by either a stream-cipher mode or a block-cipher mode employing a cryptographic primitive that operates on blocks.
    [Show full text]
  • OCB: a Bock-Cipher Mode of Operation for Efficient Authenticated Encryption
    OCB: A Bock-Cipher Mode of Operation for Efficient Authenticated Encryption Phillip Rogaway UC Davis This work done at Chiang Mai University [email protected] http://www.cs.ucdavis.edu/~rogaway Mihir Bellare John Black Ted Krovetz UC San Diego University of Nevada UC Davis CCS-8 — Philadelphia, USA — November 8, 2001 Slide 1 Principal Goals of Symmetric Cryptography Privacy What the Adversary sees tells her nothing of significance about the underlying message M that the Sender sent Authenticity The Receiver is sure that the string he receives was sent (in exactly this form) by the Sender Authenticated Encryption Achieves both privacy and authenticity C C* Nonce M M K Adversary K or invalid K K Sender Receiver Slide 2 Why Authenticated Encryption? • Efficiency By merging privacy and authenticity one can achieve efficiency difficult to achieve if handling them separately. • Easier-to-correctly-use abstraction By delivering strong security properties one may minimize encryption-scheme misuse. Slide 3 Easier to correctly use because stronger security properties Idealized encryption OCB Authenticated encryption [Bellare, Rogaway] IND-CPA + auth of ciphertexts [Katz,Yung] [Bellare, Namprempre] IND-CCA = NM-CCA CTR, CBC$ [Goldwasser, Micali] IND-CPA [Bellare, Desai, Jokipii, Rogaway] ECB Slide 4 Right or Wrong? It depends on what definition E satisfies K A . R K A A B EK (A . B . RA . RB .sk) EK (RB) Slide 5 Folklore approach. See Generic Composition [Bellare, Namprempre] and [Krawczyk] Traditional approach to authenticated encryption for
    [Show full text]
  • Global Journal of Engineering Science And
    [Arslan, 6(3): March 2019] ISSN 2348 – 8034 DOI- 10.5281/zenodo.2599921 Impact Factor- 5.070 GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES PRIVACY PRESERVING SECURITY MECHANISM FOR IOT BASED DISTRIBUTED SMART HEALTHCARE SYSTEM Farrukh Arslan School of Electrical and Computer Engineering, Purdue University, USA ABSTRACT Data security and privacy are one of the key concerns in the Internet of Things (IoT). Usage of IOT is increasing in the society day-by-day, and security challenges are becoming more and more severe. From a data perspective, IOT data security plays a major role. Some of the sensitive data such as criminal record, military information, the medical record of the patients, etc. Due to the size and other features of IOT, it is almost impossible to create an efficient centralized authentication system. The proposed system focused on IoT security for distributed medical record to provide perimeter security to the patient. Building trust in distributed environments without the need for authorities is a technological advance that has the potential to change many industries, the IOT is one among them. Furthermore, it protects data integrity and availability. It improves the accessibility of data by using the indexing method along with the blockchain. Moreover, it facilitate the utility of tracking the previous history of the patient record using the hyper ledger with authorization. Keywords: security, Internet of Things, Health-care, Block chain, Hyper ledger. I. INTRODUCTION Amount of information grows day by day but the security of the data is not maintained properly. Nowadays blockchain technology is very useful in IOT field such as smart cities, smart home system as well as it provides security [1].
    [Show full text]
  • CMU-CS-17-118 July 2017
    Secure Large-Scale Outsourced Services Founded on Trustworthy Code Executions Bruno Vavala CMU-CS-17-118 July 2017 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Faculty of Sciences University of Lisbon 1749-16 Lisbon, Portugal Thesis Committee: Peter Steenkiste, Co-Chair Nuno Neves, University of Lisbon, Co-Chair Anupam Datta Vyas Sekar Antonia Lopes, University of Lisbon Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Copyright c 2017 Bruno Vavala This research was sponsored by Fundac¸ao˜ para a Cienciaˆ e Tecnologia (Portuguese Foundation for Science and Technology) through the Carnegie Mellon Portugal Program under grant SFRH/BD/51562/2011 (until August 2016) and the Information and Communication Technology Institute at Carnegie Mellon University, by FCT through project UID/CEC/00408/2013 (LaSIGE), by the EC through project FP7-607109 (SEGRID) and project H2020-643964 (SUPERCLOUD). The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the Portuguese government, the U.S. government or any other entity. Keywords: Trusted Computing, Cloud Security, Trusted Execution Abstraction, Execution Integrity, Code Identity, Large-scale Data, TPM, Intel SGX, Efficient Execution Verification, Passive Replication, Service Availability This work was partially supported by the Fundac¸ao˜ para a Cienciaˆ e Tecnologia (FCT) through research grant SFRH/BD/51562/2011 (until August 2016) and through project UID/CEC/00408/2013 (LaSIGE), by the Informa- tion and Communication Technology Institute at Carnegie Mellon University, by the EC through project FP7-607109 (SEGRID) and project H2020-643964 (SUPERCLOUD).
    [Show full text]
  • The Evolution of Authenticated Encryption
    The Evolution of Authenticated Encryption Phillip Rogaway University of California, Davis, USA Those who’ve worked with me on AE: Mihir Bellare Workshop on Real-World Cryptography John Black Thursday, 10 January 2013 Ted Krovetz Stanford, California, USA Chanathip Namprempre Tom Shrimpton David Wagner 1/40 Traditional View (~2000) Of Symmetric Goals K K Sender Receiver Privacy Authenticity (confidentiality) (data-origin authentication) Encryption Authenticated Encryption Message scheme Achieve both of these aims Authentication Code (MAC) IND-CPA [Goldwasser, Micali 1982] Existential-unforgeability under ACMA [Bellare, Desai, Jokipii, R 1997] [Goldwasser, Micali, Rivest 1984, 1988], [Bellare, Kilian, R 1994], [Bellare, Guerin, R 1995] 2/40 Needham-Schroeder Protocol (1978) Attacked by Denning-Saco (1981) Practioners never saw a b IND-CPA as S encryption’s goal A . B . NA {N . B . s . {s . A} } 1 A b a 2 a b {s . A} A 3 b B 4 {NB}s 5 {NB -1 }s 3/40 Add redundancy No authenticity for any S = f (P) CBC ~ 1980 Doesn’t work Beyond CBC MAC: regardless of how you compute unkeyed checksums don’t work even the (unkeyed) checksum S = R(P1, …, Pn) with IND-CCA or NM-CPA schemes (Wagner) [An, Bellare 2001] 4/40 Add more arrows PCBC 1982 Doesn’t work See [Yu, Hartman, Raeburn 2004] The Perils of Unauthenticated Encryption: Kerberos Version 4 for real-world attacks 5/40 Add yet more stuff iaPCBC [Gligor, Donescu 1999] Doesn’t work Promptly broken by Jutla (1999) & Ferguson, Whiting, Kelsey, Wagner (1999) 6/40 Emerging understanding that: - We’d like
    [Show full text]
  • ATAES132A 32K AES Serial EEPROM Complete Data Sheet
    ATAES132A ATAES132A 32K AES Serial EEPROM Complete Data Sheet Features • Crypto Element Device with Secure Hardware-Based Key Storage • 32 kb Standard Serial EEPROM Memory – Compatible with the Microchip AT24C32D and the Microchip AT25320B – 16 User Zones of 2 kb Each • High-Security Features – AES Algorithm with 128-bit Keys – AES-CCM for Authentication – Message Authentication Code (MAC) Capability – Guaranteed Unique Die Serial Number – Secure Storage for up to Sixteen 128-bit Keys – Encrypted User Memory Read and Write – Internal High-Quality FIPS Random Number Generator (RNG) – 16 High-Endurance Monotonic EEPROM Counters • Flexible User Configured Security – User Zone Access Rights Independently Configured – Authentication Prior to Zone Access • Read/Write, Encrypted, or Read-Only User Zone Options • High-Speed Serial Interface Options – 10 MHz SPI (Mode 0 and 3) – 1 MHz Standard I2C Interface • 2.5V to 5.5V Supply Voltage Range • <250 nA Sleep Current • 8-pad UDFN and 8-lead SOIC Package Options • Temperature Range: -40°C to +85°C Applications • Easily Add Security by Replacing Existing Serial EEPROM • Authenticate Consumables, Components, and Network Access • Protect Sensitive Firmware • Securely Store Sensitive Data and Enable Paid-for Features • Prevent Contract Manufacturers from Overbuilding • Manage Warranty Claims • Securely Store Identity Data (i.e. Fingerprints and Pictures) © 2018 Microchip Technology Inc. Datasheet Complete DS40002023A-page 1 ATAES132A Description The Microchip ATAES132A is a high-security, Serial Electrically-Erasable and Programmable Read-Only Memory (EEPROM) providing both authentication and confidential nonvolatile data storage capabilities. Access restrictions for the 16 user zones are independently configured, and any key can be used with any zone.
    [Show full text]
  • Design and Analysis of Decentralized Public Key Infrastructure with Quantum-Resistant Signatures
    석 ¬ Y 위 | 8 Master's Thesis 양자 ´1 서명D t©\ È중YT 공개¤ 0반 lpX $Ä 및 분석 Design and Analysis of Decentralized Public Key Infrastructure with Quantum-resistant Signatures 2018 H 형 철 (W ; 哲 An, Hyeongcheol) \ m 과 Y 0 Ð Korea Advanced Institute of Science and Technology 석 ¬ Y 위 | 8 양자 ´1 서명D t©\ È중YT 공개¤ 0반 lpX $Ä 및 분석 2018 H 형 철 \ m 과 Y 0 Ð 전산Y부 (정보보8대YÐ) Design and Analysis of Decentralized Public Key Infrastructure with Quantum-resistant Signatures Hyeongcheol An Advisor: Kwangjo Kim A dissertation submitted to the faculty of Korea Advanced Institute of Science and Technology in partial fulfillment of the requirements for the degree of Master of Science in Computer Science (Information Security) Daejeon, Korea June 12, 2018 Approved by Kwangjo Kim Professor of Computer Science The study was conducted in accordance with Code of Research Ethics1. 1 Declaration of Ethical Conduct in Research: I, as a graduate student of Korea Advanced Institute of Science and Technology, hereby declare that I have not committed any act that may damage the credibility of my research. This includes, but is not limited to, falsification, thesis written by someone else, distortion of research findings, and plagiarism. I confirm that my thesis contains honest conclusions based on my own careful research under the guidance of my advisor. MIS H형철. 양자 ´1 서명D t©\ È중YT 공개¤ 0반 lpX $Ä 및 분석. 전산Y부 (정보보8대YÐ) . 2018D. 50+iv ½. 지ÄP수: @광p. 20164355 (영8 |8) Hyeongcheol An. Design and Analysis of Decentralized Public Key Infras- tructure with Quantum-resistant Signatures.
    [Show full text]
  • Replay Attack Vulnerabilities and Mitigation Strategies a Study of a Unique Class of Attack and Several Methods Attempting to Prevent Attacks of a Kind
    Replay Attack Vulnerabilities and Mitigation Strategies A Study of a Unique Class of Attack and Several Methods Attempting to Prevent Attacks of a Kind Alex Goldschmidt 1 Abstract Replay attacks are a unique class of network infiltration that have harmful effects both online and offline. With encryption becoming cryptographically stronger every year, a movement from attacks based on decryption to attacks based in replay of encrypted information is almost inevitable. In this project, replay attacks will be looked at more closely, along with several ways to protect against them. Replay attacks have been used to compromise SSL sessions, perform fraudulent transactions with chip-based credit cards, and even to break into cars and garage doors. While many methods have been put forward, including time-based encryption and origin/destination verification, there is no single solution to this problem, but instead one must incorporate several strategies to fully protect against such an attack. Introduction In the world of security, there are innumerable methods of compromising a network. Whether the attacker’s goal is to shut down communication between parties, or to steal information from an unsuspecting victim, the security system in place must be able to defend against it. The best method of protecting information, which prevents a lot of these attacks from being feasible, is to encrypt all data that is transmitted from one place to another. However, what happens when the attacker doesn’t need to know what the message actually says? This is the principle behind the Replay Attack. Replay Attacks are listed as entry 294 in the Common Weakness Enumeration (CWE), where they are described as a “flaw [that] exists when the design of the software makes it possible for a malicious user to sniff network traffic and bypass authentication by replaying it to the server in question to the same effect as the original message” (Mitre, 2015).
    [Show full text]
  • Ios Security Ios 12.3
    iOS Security iOS 12.3 May 2019 Contents Page 5 Introduction Page 6 System Security Secure boot chain System Software Authorization Secure Enclave OS Integrity Protection Touch ID Face ID Page 15 Encryption and Data Protection Hardware security features File Data Protection Passcodes Data Protection classes Keychain data protection Keybags Page 25 App Security App code signing Runtime process security Extensions App Groups Data Protection in apps Accessories HomeKit SiriKit HealthKit ReplayKit Secure notes Shared notes Apple Watch Page 39 Network Security TLS VPN Wi-Fi Bluetooth Single sign-on Continuity AirDrop security Wi-Fi password sharing iOS Security | May 2019 2 Page 47 Apple Pay Apple Pay components How Apple Pay uses the Secure Element How Apple Pay uses the NFC controller Credit, debit, and prepaid card provisioning Payment authorization Transaction-specific dynamic security code Paying with credit and debit cards in stores Paying with credit and debit cards within apps Paying with credit and debit cards on the web Contactless passes Apple Pay Cash Transit cards Student ID cards Suspending, removing, and erasing cards Page 58 Internet Services Apple ID iMessage Business Chat FaceTime iCloud iCloud Keychain Siri Safari Suggestions, Siri Suggestions in Search, Lookup, #images, News app, and News widget in non-News countries Safari Intelligent Tracking Prevention Page 73 User Password Management App access to saved passwords Automatic strong passwords Sending passwords to other people or devices Credential provider extensions Page
    [Show full text]
  • Certificate in E Certificate in E-Governance and Security Information System (CEGCS-04) Vernance and Cyber
    Certificate in e -Governance and Cyber Security Information System (CEGCS-04) Title Information System Adviso rs Mr. R. Thyagarajan, Head, Admn. & Finance and Acting Director, CEMCA Dr. Manas Ranjan Panigrahi, Program Officer(Education) , CEMCA Prof. Durgesh Pant, Director -SCS&IT, UOU Editor Er. Gopesh Pande, Network Engineer, Wipro Infotech, Mumbai Authors Block I> Unit I, Unit II, Unit III & Unit IV Er. Charanjeet Singh Chawla, Wing Commander, Indian Air Force, Ministry of Defence Block II> Unit I, Unit II, Unit III & Unit IV Er. Ashok Katariya, Group Captain, Indian Air Force, Ministry of Defence Block III> Unit I, Unit II, Unit III & Unit IV Er. Ashok Katariya, Group Captain, Indian Air Force, Ministry of Defence ISBN : 978 -93 -84813 -93 -2 Acknowledgement The University acknow ledges with thanks the expertixe and financial support provided by Commonwealth Educational Media Centre for Asia(CEMCA), New Delhi, for the preparation of this study material. Uttarakhand Open University, 2016 © Uttarak hand Open University, 2016. Information System is made available under a Creative Commons Attribution Share-Alike 4.0 Licence (international): http://creativecommons.org/licenses/by -sa/4.0/ It is attributed to the sources marked in the References, Article Sources and Contributors section. Published by: Uttarakhand Open University, Haldwani Expert Panel S. No. Name 1 Dr. Jeetendra Pande, School of Computer Science & IT, Uttarakhand Open University, Haldwani 2 Prof. Ashok Panjwani, Professor, MDI, Gurgoan 3 Group Captain Ashok Katariya, Ministry of Defense, New Delhi 4 Mr. Ashutosh Bahuguna, Scientist- CERT-In, Department Of Electronics & Information Technology, Government Of India 5 Mr. Sani Abhilash, Scientist- CERT-In, Department Of Electronics & Information Technology, Government Of India 6 Wing Commander C.S.
    [Show full text]
  • (12) Patent Application Publication (10) Pub. No.: US 2016/0028552 A1 Spanos Et Al
    US 2016.0028552A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2016/0028552 A1 Spanos et al. (43) Pub. Date: Jan. 28, 2016 (54) SYSTEMAND METHOD FOR CREATING A tion No. 62/170,131, filed on Jun. 3, 2015, provisional MULT-BRANCHED BLOCKCHAIN WITH application No. 62/185,613, filed on Jun. 27, 2015. CONFIGURABLE PROTOCOL RULES Publication Classification (71) Applicants: Nikolaos Spanos, New York, NY (US); (51) Int. Cl. Andrew R. Martin, New York, NY H04L 9M32 (2006.01) (US); Eric T. Dixon, North Bergen, NJ G06F 12/02 (2006.01) (US); Asterios Steven Geros, New York, H04L 29/06 (2006.01) NY (US) G06F 2/14 (2006.01) (72) Inventors: Nikolaos Spanos, New York, NY (US); (52) U.S. Cl. Andrew R. Martin, New York, NY CPC ............ H04L 9/3297 (2013.01); H04L 9/3268 Bergen, NJ (2013.01); H04L 9/3242 (2013.01); G06F (US); Eric T. Dixon, North 12/1408 (2013.01); G06F 12/0246 (2013.01); (US); Asterios Steven Geros, New York, H04L 63/164 (2013.01); H04L 63/168 NY (US) (2013.01); G06F 2212/1052 (2013.01); G06F (73) Assignee: BLOCKCHAIN TECHNOLOGIES 2212/7209 (2013.01) CORPORATION, New York, NY (US) (57) ABSTRACT The present invention generally relates to blockchain tech (21) Appl. No.: 14/809,062 nology. Specifically, this invention relates to creating a block chain called a slidechain that allows for multiple valid (22) Filed: Jul. 24, 2015 branches or forks to propagate simultaneously with a custom ized set of protocol rules embedded in and applied to each fork chain that branches from another chain.
    [Show full text]