RSA (cryptosystem)/RSA (cryptosystem) - 英文万维百科/维基百科中文版

Cryptography news and discussions

Cryptography is the art of creating mathematical assurances for who can do what with data, including but not limited to encryption of messages such that only the key-holder can read it. Cryptography lives at an intersection of math and computer science. This subreddit covers the theory and practice of modern and *strong* cryptography, and it is a technical subreddit focused on the algorithms and implementations of cryptography.
[link]

Algorand [ALGO] vs Cardano [ADA] - Difference, Partnerships & Ecosystem - Which is Better?

Algorand [ALGO] vs Cardano [ADA] - Difference, Partnerships & Ecosystem - Which is Better?

https://preview.redd.it/pdt01cdmj9551.png?width=1240&format=png&auto=webp&s=50e6d140a68eb2f3a3380175c2869c415b5014da

Introduction

The ‘Trilemma’ of Blockchain space - Scalability, Security, and Decentralization - are the three things every blockchain is trying to solve simultaneously. But it’s easier said than done, as proven by the scalability issue faced by Ethereum. Higher scalability transcends to higher market adoption.
This is where Cardano and Algorand have come into the picture. They have their similarities and differences that seem to work for them for now. Rather than telling you which one has more potential, it’s better to present the entire case and let you decide how they fare against each other.

Star Player of the Team

Anyone would agree that having a renowned and accomplished team player always gives a boost to the project.

Cardano’s Charles Hoskinson

If the name seems familiar, that’s because he is also the co-founder of Ethereum. A tech entrepreneur and mathematician with an interest in analytic number theory, Charles Hoskinson moved into blockchain space in 2013. He co-developed the Ethereum blockchain with Vitalik Buterin before leaving the project in June 2014.
Hoskinson joined crypto and blockchain research firm IOHK to develop Cardano and since then has sponsored various blockchain research labs at the Tokyo Institute of Technology and the University of Edinburgh. He also founded Invictus Innovations.
Hoskinson was the founding chairman of the education committee of the Bitcoin Foundation and established the Cryptocurrency Research Group in 2013. His current focus lies in educating people on the use of crypto and decentralization.

Algorand’s Silvio Micali

Unlike the innovators of other blockchain projects, Silvio Micali is already a famous name in cryptography long before he started developing Algorand. Deemed as one of the top cryptographers, he is a recipient of the prestigious Turing Award in 2012 and RSA prize for cryptography, Gödel Prize (theoretical computer science) in 1993, and ACM fellowship in 2017.
Micali’s work spans around public-key cryptosystems, pseudorandom functions, digital signatures, oblivious transfer, and secure multi-party computation among others. In 1989, he co-invented Zero-Knowledge Proofs with Shafi Goldwasser and Charles Rackoff. He also developed Peppercoin, a cryptographic system for processing micropayments.
A professor at MIT’s electrical engineering and computer science department since 1983, Silvio Micali is also working as a computer scientist at MIT Computer Science and Artificial Intelligence Laboratory. His doctoral students include Shai Halevi, Mihir Bellare, Rafail Ostrovsky, Bonnie Berger, Rafael Pass, Chris Peikert, and Phillip Rogaway - each renowned in their respective fields.

Project Partners and Collaborators

For any business, partnerships and collaborations are the most important aspect since they drive growth and innovation.

Cardano Partnerships

Cardano has formed 17 partnerships so far that either enhance its capabilities or grow its business.
  • Metaps Plus: To integrate the ADA coins into the MeTaps Plus, South Korea’s one of the largest mobile payment platforms.
  • IBM Research: For a software distribution project commissioned by the European Union.
  • PriceWaterhouseCoopers (PwC): To develop a new commercial strategy, probably to bring enterprise users to Cardano.
  • New Balance: All customers can authenticate the footwear purchases on the Cardano blockchain.
  • SIRIN LABS: To integrate the Cardano blockchain in their blockchain smartphone FINNEY and its SIRIN OS.
  • Konfidio: To drive the adoption of the blockchain business model platform among corporations and governments.
  • Algoz: To offer liquidity solutions and trading solutions for its native ADA token.
  • Priviledge: To study and publish decentralized software updates Priviledge is a consortium of renowned companies and scientific universities with the European Union.
  • South Korea Government-Approved Trade Associations:Signed two MoUs with Korea Mobile Game Association (KMGA) and Korea Blockchain Contents Association (KBCCA) to implement Cardano for Korean mobile gaming and digital content.
  • Ethiopian Government: To develop a new digital payment system and combine it with identity cards using its Atala blockchain framework.
  • Georgian Government: Signed MoU to implement Cardano blockchain-enabled projects across education, business, and government services.
Cardano’s other major partnership includes Z/Yen Group’s Distributed Futures practice, COTI Network, and Ellipal Hardware.

Algorand Partnerships

Algorand’s innovativeness and potential to be the blockchain leader has helped it bag a plethora of valuable partnerships across the world. Here are a few partnerships out of the 17 -
  • International Blockchain Monetary Reserve (IBMR): To launch the Southeast Asia Microfinance Platform and create a stablecoin called Asia Reserve Currency Coin (ARCC) to encourage financial inclusion in Southeast Asia.
  • SFB Technologies: To build the infrastructure to create a CBDC (central bank digital currency) dubbed ‘SOV’ for the Marshall Islands.
  • Meld: To tokenize gold and track it over the supply chain using stablecoin for the Australian gold industry.
  • Caratan: To build financial tools and products to promote Fintech adoption at an institutional level.
  • Italian Society of Authors and Publishers (SIAE): To develop copyright management tools and services.
  • DUST Identity: To authenticate physical objects and validate transactions over the blockchain.
  • AssetBlock: A real estate startup launched its tokenized property investment platform on Algorand
  • PlanetWatch: Focused on environmental monitoring, the first "CERN Spin-off " labeled organization is building the world's first immutable air quality ledger on the Algorand blockchain using IoT technologies.
Other major partnerships include World Chess - the commercial arm of the World Chess Federation, Big Data company Syncsort, and Tether.

Consensus Algorithm

Both Cardano and Algorand use PoS or Proof of Stake consensus mechanism at their heart, but that’s where the similarity ends. Each of them has its own spin to it.
In the PoS mechanism, a person can validate a block depending on how many stakes or coins he holds. The stake quantity determines the amount of mining power one has. So how does each of them differ?

Cardano

Cardano’s version is called Ouroboros PoS.
  • Cardano allows stakeholders to pool their resources together in a single ‘stake pool’, thus delegating their stakes to the pool. This is because every elected stakeholder may not have the expertise to create blocks.
  • The physical timeline is divided into small blocks called ‘epochs’ that are made up of fixed slots. These epochs are cyclic.
  • Each such epoch consists of a set of pooled stakeholders.
  • While the endorsers are elected depending on the weight of the number of stakes held by them, a slot leader (for every epoch) is randomly chosen by a digital coin toss among stakeholders. When the endorsers approve the blocks produced by slot leaders, it gets added to the blockchain.
  • The slot leader also selects the slot leader for the next epoch through the ‘coin toss’.
  • Note that having a higher stake increases the probability of getting elected.
  • Currently, the list of validators is fixed and the succession is known beforehand.
With the launch of the Shelley mainnet, Cardano plans to remove the above issue. But this will be a hard fork. Here, the community will decide on block validators through staking.

Algorand

The version Algorand uses is called PPoS (Pure Proof of Stake) consensus mechanism.
  • PPoS randomly selects a token holder as a block producer.
  • The proposed block gets approved by a committee of 1000 randomly selected token owners and then added to the blockchain.
  • The algorithm runs a cryptographically verifiable lucky draw over all the accounts to randomly select committee members as well as the block proposer.
  • This means the identities of the participants are unknown until the blocks are added to the chain.
  • This selection does not depend on the stake size of the nodes at all.
  • PPoS runs this lottery process in complete isolation with other nodes in the network.
The completely randomized election and secret identities of the committee members drastically reduce the chances of any foul playing within the network. As the number of users grows, the network gets stronger and more secure.
Algorand’s PPoS has embraced a more egalitarian ecosystem to negate the wealth gap present in traditional PoS.

Handling Scalability

Cardano

Currently, Cardano offers 50-250 TPS. But with incorporating sharding technology in its Ouroboros Hydra version, the scalability can increase to one million TPS theoretically. The processing speed will increase as more users or nodes join the network.

Algorand

In Algorand, every lottery takes just a microsecond to run. Since such lotteries run independently of each other, multiple lotteries can run simultaneously. This inherently makes PPoS highly scalable. The mainnet itself has the capability to handle 1000 TPS.

Conclusion

Both Cardano and Algorand have sound tech and teams that believe in extensive research and meticulously designed products. Having an early start, there’s no denying that Cardano has established itself in a superior position thanks to the technological achievement, consistency, and transparency it has showcased.
But with Algorand’s ecosystem growing fast, the competition has intensified. Algorand’s aim to bring full transparency, technological innovation, and successful partnerships just within a year have made it a prime challenger to Cardano.
While referring to Algorand, Cardano chief Hoskinson voiced similar opinion - “... they are another one of the science coins and we all kind of support each other. Even though we get academically competitive, we're able to reference each other's work and learn from each other and grow from each other.”
submitted by Superb_Recognition to algorand [link] [comments]

I have 3,000 solar powered Artik 710’s (Mali GPU), can I cloud mine

Title says it all. I have 3,000 Samsung Artik 700’s that are solar powered (large panel grids) that I pay zero to power all day.
Can I set these up as miners with slushpool and mine some bitcoin over the next 3 years?
I was thinking cgminer for my mining application.
8x ARM® Cortex®[email protected]
3D graphics accelerator
1GB DDR3 @ 800MHz 4GB eMMC
Edit: I said cloud mine. Someone already made fun of me. It’s Pool mining.
Cryptographic Hardware Acceleration: Dedicated cryptographic acceleration hardware which provides support for random number generation, block cipher (AES/DES), Hash functions (SHA[1/2/3] with HMAC), and public key cryptosystem (RSA, ECDSA, DH, ECDH)
submitted by SlevinsBrother77 to BitcoinMining [link] [comments]

Words from the founders of ABCardO

The family of public-key cryptosystems, a fundamental breakthrough in modern cryptography in the late 1970s, has increasingly become a part of our communication networks over the last three decades. The Internet and other communication systems rely principally on the Diffie-Hellman key exchange, RSA encryption, and digital signatures using DSA, ECDSA, or related algorithms. The security of these cryptosystems depends on the difficulty of number theory problems such as Integer Factorization and the Discrete Log Problem. In 1994, Peter Shor showed that quantum computers could solve each of these problems in polynomial time, thus rendering the security of all cryptosystems based on such assumptions impotent. In the academic world, this new science bears the moniker Post-Quantum Cryptography (PQC).
In August 2015, the National Security Agency (NSA) published an online announcement stating a plans to transition to quantum-resistant algorithms. In December 2016, the National Institute of Standards and Technology (NIST) announced a call for proposals of quantum resistant algorithms with a deadline of November 30th 2017.
In light of the threat that quantum computers pose to cryptosystems such as RSA and ECC, the once-distant need to develop and deploy quantum-resistant technologies is quickly becoming a reality. Cryptocurrencies like Bitcoin are new financial instruments which are created to make financial transactions more efficient, cheaper, and decentralized. Their fundamental building blocks are cryptographic algorithms such as ECC digital signatures which are used to perform various functions to ensure the integrity and security of the whole system. However, the use of ECC signatures and other similar cryptographic algorithms means that quantum computing could pose a fatal threat to the security of existing cryptocurrencies, which deploy number theory-based public key cryptosystems extensively.
The mission of the ABCMint Foundation is to successfully develop quantum-resistant blockchain technology. We also look to promote and support fundamental research for quantum computing technology and post-quantum algorithms.
submitted by prelude406 to ABCardO_PQC [link] [comments]

Is cryptography a math?

Is cryptography a math?
Cryptography is all about math. Cryptography is built from the field of pure math known as Number theory which deals with integers and public key encryption is implemented through RSA cryptosystems.

Learn more about the Hamdan Token. Click Here: www.hamdantoken.io
#hamdantoken #cryptocurrency #bitcoin #blockchain #btc #crypto #price #ethereum #ico #ltc #trading #eth #market #money #forex #trading #bitcoinmining #cryptonews #investment #entrepreneur #cryptotrading #business #forextrader #investing #bitcoinnews #litecoin #invest #binaryoptions #bitcoincash #coinbase #bitcoins #ripple #investor #trader #binance

https://preview.redd.it/i8korywwxgb41.jpg?width=800&format=pjpg&auto=webp&s=9e8b44e507e4061755f218cb8878bcc38e48f3bd
submitted by hamdantokenofficial to u/hamdantokenofficial [link] [comments]

Bottos 2020 Research and Development Scheme

Bottos 2020 Research and Development Scheme

https://preview.redd.it/umh8ivbsua841.png?width=554&format=png&auto=webp&s=5c16d9d9e61503e4c9d44212eecd176eda11550a
As 2020 is now here, Bottos has solemnly released its “2020 Research and development scheme”. On one hand, we adhere to the principle of transparency so that the whole community can comprehend our next step as a whole, but more importantly, it also helps our whole team to think deeply about the future and reach consensus. It is strongly believed that following these consistent follow-ups will help us to in order to achieve the best results.
Based on the efficient development of Bottos, the team’s technical achievements in consensus algorithms and smart contracts are used to deeply implement and optimize the existing technical architecture. At the same time using the community’s technical capabilities, horizontal development, expanding new functional modules and technical directions it stays closely integrated with the whole community.
In the future, we will keep on striving to achieve in-depth thinking, comprehensive planning, and flexible adjustment.


Overview of Technical Routes

https://preview.redd.it/rk9tpg2uua841.png?width=554&format=png&auto=webp&s=77e607b81f31c0d20feaa90eca81f09a23addca4
User feedback within the community is the driving force behind Bottos progress. In the development route of the community and industry we have formulated a roadmap for technical development, pointing out the right path for the team towards the right direction among the massive routes of modern technology.
As part of our 2020 research and development objective we have the following arrangements:
1. Intensifying enormous number of smart contracts and related infrastructures
After many years of development, smart contracts have gradually become the core and standard function in blockchain projects. The strength of smart contracts, ease of use, and stability represent the key capabilities of a blockchain project. As a good start, Bottos has already made great progress in the field of smart contracts. In smart contracts we still need to increase development efforts, making the ease of use and stability of smart contracts the top priority of our future development.
Reducing the barriers for developers and ordinary users to use, shortening the contract development cycle and saving users time is another important task for the team to accomplish. To this end, we have planned an efficient and easy-to-use one-stop contract development, debugging, and deployment tool that will provide multiple access methods and interfaces to the test network to support rapid deployment and rapid debugging.
2. Establishing an excellent client and user portal
The main goal here is to add an entrance point to the creation and deployment of smart contracts in the wallet client. To this end, the wallet needs to be transformed, a local compiler for smart contracts must be added, and an easy-to-use UI interface can be provided for the purpose of creating, deploying, and managing contracts to meet the needs of users with a single mouse click only.
3. Expanding distributed storage
Distributed storage is another focus of our development in the upcoming year. Only by using a distributed architecture can completely solve the issue of performance and scalability of stand-alone storage. Distributed storage suitable for blockchain needs to provide no less than single machine performance, extremely high availability, no single point of failure, easy expansion, and strong consistent transactions. These are the main key points and difficulties of Bottos in field of distributed storage in the upcoming days.
4. Reinforcing multi party secured computing
Privacy in computing is also a very important branch to deal with. In this research direction, Bottos has invested a lot of time and produced many research results on multi-party secured computing, such as technical articles and test cases. In the future, we will continue to give efforts in the direction of multi-party secured computing and apply mature technology achievements into the functions of the chain.

2020 Bottos — Product Development

Support for smart contract deployment in wallets
The built-in smart contract compiler inside the wallet supports compilation of the smart contracts in all languages provided by Bottos and integrates with the functions in the wallet. It also supports one-click deployment of the compiled contract source code in the wallet.
When compiling a contract, one can choose whether to pre-execute the contract code. If pre-execution is selected, it will connect to the remote contract pre-execution service and return the execution result to the wallet.
When deploying a contract, one can choose to deploy to the test network or main network and the corresponding account and private key of the test network or main network should be provided.

2020 Bottos-Technical Research

https://preview.redd.it/x2k65j7xua841.png?width=553&format=png&auto=webp&s=a40eae3c56b664c031b3db96f608923e670ff331
1. Intelligent smart contract development platform (BISDP)
The smart contract development platform BISDP is mainly composed of user-oriented interfaces, as well as back-end compilation and deployment tools, debugging tools, and pre-execution frameworks.
The user-oriented interface provides access methods based on WEB, PC, and mobile apps, allowing developers to quickly and easily compile and deploy contracts and provide contract template management functions. It can also manage the contract remotely by viewing the contract execution status, the consumed resources and other information.
In the compilation and deployment tool a set of smart contract source code editing, running, debugging, and deployment solutions as well as smart contract templates for common tasks are provided, which greatly reduces the threshold for developers to learn and use smart contracts. At the same time, developers and ordinary users are provided with a smart contract pre-execution framework, which can check the logical defects and security risks in smart contracts before actual deployment and promptly remind users a series of problems even before the smart contracts are actually run.
In the debugging tool, there are built-in local debugging and remote debugging tools. Multiple breakpoints can be set in the debugging tool. When the code reaches the breakpoint, one can view the variables and their contents in the current execution stack. One can also make conditional breakpoints based on the value of the variable. The code will not execute until the value reaches a preset value in memory.
In the pre-execution framework, developers can choose to pre-execute contract code in a virtual environment or a test net, checking out problems in some code that cannot be detected during compilation time and perform deeper code inspection. The pre-execution framework can also prompt the user in advance about the time and space resources required for execution.
2. Supporting Python and PHP in BVM virtual machine for writing smart contracts
We have added smart contract writing tools based on Python and PHP languages. These languages can be compiled into the corresponding BVM instruction set for implementation. These two reasons are used as the programming language for smart contracts.
For the Python language, the basic language elements supported by the first phase are:
- Logic control: If, Else, Eli, While, Break, method calls, for x in y
- Arithmetic and relational operators: ADD, SUB, MUL, DIV, ABS, LSHIFT, RSHIFT, AND, OR, XOR, MODULE, INVERT, GT, GTE, LT, LTE, EQ, NOTEQ
-
Data structure:
- Supports creation, addition, deletion, replacement, and calculation of length of list data structure
- Supports creation, append, delete, replace, and calculation of length of dict data structure
Function: Supports function definition and function calls
For the PHP language, the basic language elements supported by the first phase are :
- Logic control: If, Else, Eli, While, Break, method calls
- Arithmetic and relational operators: ADD, SUB, MUL, DIV, ABS, LSHIFT, RSHIFT, AND, OR, XOR, MODULE, INVERT, GT, GTE, LT, LTE, EQ, NOTEQ
Data structure:
- Support for creating, appending, deleting, replacing, and calculating length of associative arrays
Function: Supports the definition and calling of functions
For these two above mentioned languages, the syntax highlighting and code hinting functions are also provided in BISDP, which is very convenient for developers to debug any errors.
3. Continuous exploration of distributed storage solutions
Distributed storage in blockchain technology actually refers to a distributed database. Compared with the traditional DMBS, in addition to the ACID characteristics of the traditional DBMS, the distributed database also provides the high availability and horizontal expansion of the distributed system. The CAP principle of distributed system reveals that for a common distributed system there is an impossible triangle, only two of them can be selected among its three directions, consistency, availability, and partition fault tolerance. Distributed databases in China must require strong consistency. This is due to the characteristics of the blockchain system itself, because it needs to provide reliable distributed transaction capabilities. For these technical issues, before ensuring that the distributed storage solution reaches 100% availability, we will continue to invest more time and technical strength, do more functional and performance testing, and conduct targeted tests for distributed storage systems.
4. Boosting secured multi-party computing research and development
Secured multi-party Computing (MPC) is a cryptographic mechanism that enables multiple entities to share data while protecting the confidentiality of the data without exposing the secret encryption key. Its performance indicators, such as security and reliability are important for the realization of the blockchain. The transparent sharing of the data privacy on the distributed ledger and the privacy protection of the client wallet’s private key are truly essential.
At present, the research and development status of the platform provided by Bottos in terms of privacy-enhanced secured multi-party computing is based on the BIP32 / 44 standard in Bitcoin wallets to implement distributed management of client wallet keys and privacy protection.
Considering the higher level of data security and the distributed blockchain account as the public data of each node, further research and development are being planned on:
(1) Based on RSA, Pailliar, ECDSA and other public key cryptosystems with homomorphic attributes, as well as the GC protocol, OT protocol, and ZKP protocol to generate and verify transaction signatures between two parties;
(2) Introduce the international mainstream public key system with higher security and performance, national secret public key encryption system, and fewer or non-interactive ZKP protocols to achieve secured multi-party computing with more than two parties, allowing more nodes to participate Privacy protection of ledger data.

Summary

After years of exploration, we are now full of confidence in our current research and development direction. We are totally determined to move forward by continuous hard work. In the end, all members of Bottos also want to thank all the friends in the community for their continuous support and outstanding contributions. Your certainty is our greatest comfort and strongest motivation.

Be smart. Be data-driven. Be Bottos.
If you aren’t already in our group, please join now! https://t.me/bottosofficial
Join Our Community and Stay Updated!
Bottos Website | Twitter |Facebook | Telegram | Reddit
submitted by BOTTOS_AI to Bottos [link] [comments]

World History Timeline of Events Leading up to Bitcoin - In the Making

A (live/editable) timeline of historical events directly or indirectly related to the creation of Bitcoin and Cryptocurrencies
*still workin' on this so check back later and more will be added, if you have any suggested dates/events feel free to lemme know...
This timeline includes dates pertaining to:
Ancient Bartering – first recorded in Egypt (resources, services...) – doesn’t scale
Tally sticks were used, making notches in bones or wood, as a form of money of account
9000-6000 BC Livestock considered the first form of currency
c3200 BC Clay tablets used in Uruk (Iraq) for accounting (believed to be the earliest form of writing)
3000 BC Grain is used as a currency, measured out in Shekels
3000 BC Banking developed in Mesopotamia
3000 BC? Punches used to stamp symbols on coins were a precursor to the printing press and modern coins
? BC Since ancient Persia and all the way up until the invention and expansion of the telegraph Homing Pigeons were used to carry messages
2000 BC Merchants in Assyria, India and Sumeria lent grain to farmers and traders as a precursor to banks
1700 BC In Babylon at the time of Hammurabi, in the 18th century BC, there are records of loans made by the priests of the temple.
1200 BC Shell money first used in China
1000-600 BC Crude metal coins first appear in China
640 BC Precious metal coins – Gold & Silver first used in ancient Lydia and coastal Greek cities featuring face to face heads of a bull and a lion – first official minted currency made from electrum, a mixture of gold and silver
600-500 BC Atbash Cipher
A substitution Cipher used by ancient Hebrew scholars mapping the alphabet in reverse, for example, in English an A would be a Z, B a Y etc.
400 BC Skytale used by Sparta
474 BC Hundreds of gold coins from this era were discovered in Rome in 2018
350 BC Greek hydraulic semaphore system, an optical communication system developed by Aeneas Tacticus.
c200 BC Polybius Square
??? Wealthy stored coins in temples, where priests also lent them out
??? Rome was the first to create banking institutions apart from temples
118 BC First banknote in the form of 1 foot sq pieces of white deerskin
100-1 AD Caesar Cipher
193 Aureus, a gold coin of ancient Rome, minted by Septimius Severus
324 Solidus, pure gold coin, minted under Constantine’s rule, lasted until the late 8th century
600s Paper currency first developed in Tang Dynasty China during the 7th century, although true paper money did not appear until the 11th century, during the Song Dynasty, 960–1279
c757–796 Silver pennies based on the Roman denarius became the staple coin of Mercia in Great Britain around the time of King Offa
806 First paper banknotes used in China but isn’t widely accepted in China until 960
1024 The first series of standard government notes were issued in 1024 with denominations like 1 guàn (貫, or 700 wén), 1 mín (緡, or 1000 wén), up to 10 guàn. In 1039 only banknotes of 5 guàn and 10 guàn were issued, and in 1068 a denomination of 1 guàn was introduced which became forty percent of all circulating Jiaozi banknotes.
1040 The first movable type printer was invented in China and made of porcelain
? Some of the earliest forms of long distance communication were drums used by Native Africans and smoke signals used by Native Americans and Chinese
1088 Movable type in Song Dynasty China
1120 By the 1120s the central government officially stepped in and produced their own state-issued paper money (using woodblock printing)
1150 The Knights Templar issued bank notes to pilgrims. Pilgrims deposited their valuables with a local Templar preceptory before embarking, received a document indicating the value of their deposit, then used that document upon arrival in the Holy Land to retrieve their funds in an amount of treasure of equal value.
1200s-1300s During the 13th century bankers from north Italy, collectively known as Lombards, gradually replace the Jews in their traditional role as money-lenders to the rich and powerful. – Florence, Venice and Genoa - The Bardi and Peruzzi Families dominated banking in 14th century Florence, establishing branches in many other parts of Europe
1200 By the time Marco Polo visited China they’d move from coins to paper money, who introduced the concept to Europe. An inscription warned, "All counterfeiters will be decapitated." Before the use of paper, the Chinese used coins that were circular, with a rectangular hole in the middle. Several coins could be strung together on a rope. Merchants in China, if they became rich enough, found that their strings of coins were too heavy to carry around easily. To solve this problem, coins were often left with a trustworthy person, and the merchant was given a slip of paper recording how much money they had with that person. Marco Polo's account of paper money during the Yuan Dynasty is the subject of a chapter of his book, The Travels of Marco Polo, titled "How the Great Kaan Causeth the Bark of Trees, Made Into Something Like Paper, to Pass for Money All Over his Country."
1252 Florin minted in Florence, becomes the hard currency of its day helping Florence thrive economically
1340 Double-entry bookkeeping - The clerk keeping the accounts for the Genoese firm of Massari painstakingly fills in the ledger for the year 1340.
1397 Medici Bank established
1450 Johannes Gutenberg builds the printing press – printed words no longer just for the rich
1455 Paper money disappears from China
1466 Polyalphabetic Cipher
1466 Rotating cipher disks – Vatican – greatest crypto invention in 1000 yrs – the first system to challenge frequency analysis
1466 First known mechanical cipher machine
1472 The oldest bank still in existence founded, Banca Monte dei Paschi di Siena, headquartered in Siena, Italy
1494 Double-entry bookkeeping system codified by Luca Pacioli
1535 Wampum, a form of currency used by Native Americans, a string of beads made from clamshells, is first document.
1553 Vigenere Cipher
1557 Phillip II of Spain managed to burden his kingdom with so much debt (as the result of several pointless wars) that he caused the world's first national bankruptcy — as well as the world's second, third and fourth, in rapid succession.
1577 Newspaper in Korea
1586 The Babington Plot
1590 Cabinet Noir was established in France. Its mission was to open, read and reseal letters, and great expertise was developed in the restoration of broken seals. In the knowledge that mail was being opened, correspondents began to develop systems to encrypt and decrypt their letters. The breaking of these codes gave birth to modern systematic scientific code breaking.
1600s Promissory banknotes began in London
1600s By the early 17th century banking begins also to exist in its modern sense - as a commercial service for customers rather than kings. – Late 17th century we see cheques slowly gains acceptance
The total of the money left on deposit by a bank's customers is a large sum, only a fraction of which is usually required for withdrawals. A proportion of the rest can be lent out at interest, bringing profit to the bank. When the customers later come to realize this hidden value of their unused funds, the bank's profit becomes the difference between the rates of interest paid to depositors and demanded from debtors.
The transformation from moneylenders into private banks is a gradual one during the 17th and 18th centuries. In England it is achieved by various families of goldsmiths who early in the period accept money on deposit purely for safe-keeping. Then they begin to lend some of it out. Finally, by the 18th century, they make banking their business in place of their original craft as goldsmiths.
1605 Newspaper in Straussburg
c1627 Great Cipher
1637 Wampum is declared as legal tender in the U.S. (where we got the slang word “clams” for money)
1656 Johan Palmstruch establishes the Stockholm Banco
1661 Paper Currency reappears in Europe, soon became common - The goldsmith-bankers of London began to give out the receipts as payable to the bearer of the document rather than the original depositor
1661 Palmstruch issues credit notes which can be exchanged, on presentation to his bank, for a stated number of silver coins
1666 Stockholms Banco, the predecessor to the Central Bank of Sweden issues the first paper money in Europe. Soon went bankrupt for printing too much money.
1667 He issues more notes than his bank can afford to redeem with silver and winds up in disgrace, facing a death penalty (commuted to imprisonment) for fraud.
1668 Bank of Sweden – today the 2nd oldest surviving bank
1694 First Central Bank established in the UK was the first bank to initiate the permanent issue of banknotes
Served as model for most modern central banks.
The modern banknote rests on the assumption that money is determined by a social and legal consensus. A gold coin's value is simply a reflection of the supply and demand mechanism of a society exchanging goods in a free market, as opposed to stemming from any intrinsic property of the metal. By the late 17th century, this new conceptual outlook helped to stimulate the issue of banknotes.
1700s Throughout the commercially energetic 18th century there are frequent further experiments with bank notes - deriving from a recognized need to expand the currency supply beyond the availability of precious metals.
1710 Physiocracy
1712 First commercial steam engine
1717 Master of the Royal Mint Sir Isaac Newton established a new mint ratio between silver and gold that had the effect of driving silver out of circulation (bimetalism) and putting Britain on a gold standard.
1735 Classical Economics – markets regulate themselves when free of intervention
1744 Mayer Amschel Rothschild, Founder of the Rothschild Banking Empire, is Born in Frankfurt, Germany
Mayer Amschel Rothschild extended his banking empire across Europe by carefully placing his five sons in key positions. They set up banks in Frankfurt, Vienna, London, Naples, and Paris. By the mid 1800’s they dominated the banking industry, lending to governments around the world and people such as the Vanderbilts, Carnegies, and Cecil Rhodes.
1745 There was a gradual move toward the issuance of fixed denomination notes in England standardized printed notes ranging from £20 to £1,000 were being printed.
1748 First recorded use of the word buck for a dollar, stemming from the Colonial period in America when buck skins were commonly traded
1757 Colonial Scrip Issued in US
1760s Mayer Amschel Rothschild establishes his banking business
1769 First steam powered car
1775-1938 US Diplomatic Codes & Ciphers by Ralph E Weber used – problems were security and distribution
1776 American Independence
1776 Adam Smith’s Invisible Hand theory helped bankers and money-lenders limit government interference in the banking sector
1781 The Bank of North America was a private bank first adopted created the US Nation's first de facto central bank. When shares in the bank were sold to the public, the Bank of North America became the country's first initial public offering. It lasted less than ten years.
1783 First steamboat
1791 Congress Creates the First US Bank – A Private Company, Partly Owned by Foreigners – to Handle the Financial Needs of the New Central Government. First Bank of the United States, a National bank, chartered for a term of twenty years, it was not renewed in 1811.
Previously, the 13 states had their own banks, currencies and financial institutions, which had an average lifespan of about 5 years.
1792 First optical telegraph invented where towers with telescopes were dispersed across France 12-25 km apart, relaying signals according to positions of arms extended from the top of the towers.
1795 Thomas Jefferson invents the Jefferson Disk Cipher or Wheel Cipher
1797 to 1821 Restriction Period by England of trading banknotes for silver during Napoleonic Wars
1797 Currency Crisis
Although the Bank was originally a private institution, by the end of the 18th century it was increasingly being regarded as a public authority with civic responsibility toward the upkeep of a healthy financial system.
1799 First paper machine
1800 Banque de France – France’s central bank opens to try to improve financing of the war
1800 Invention of the battery
1801 Rotchschild Dynasty begins in Frankfurt, Holy Roman Empire – established international banking family through his 5 sons who established themselves in London, Paris, Frankfurt, Vienna, and Naples
1804 Steam locomotive
1807 Internal combustion engine and automobile
1807 Robert Fulton expands water transportation and trade with the workable steamboat.
1809 Telegraphy
1811 First powered printing press, also first to use a cylinder
1816 The Privately Owned Second Bank of the US was Chartered – It Served as the Main Depository for Government Revenue, Making it a Highly Profitable Bank – charter not renewed in 1836
1816 The first working telegraph was built using static electricity
1816 Gold becomes the official standard of value in England
1820 Industrial Revolution
c1820 Neoclassical Economics
1821 British gov introduces the gold standard - With governments issuing the bank notes, the inherent danger is no longer bankruptcy but inflation.
1822 Charles Babbage, considered the "father of the computer", begins building the first programmable mechanical computer.
1832 Andrew Jackson Campaigns Against the 2nd Bank of the US and Vetoes Bank Charter Renewal
Andrew Jackson was skeptical of the central banking system and believed it gave too few men too much power and caused inflation. He was also a proponent of gold and silver and an outspoken opponent of the 2nd National Bank. The Charter expired in 1836.
1833 President Jackson Issues Executive Order to Stop Depositing Government Funds Into Bank of US
By September 1833, government funds were being deposited into state chartered banks.
1833-1837 Manufactured “boom” created by central bankers – money supply Increases 84%, Spurred by the 2nd Bank of the US
The total money supply rose from $150 million to $267 million
1835 Jackson Escapes Assassination. Assassin misfired twice.
1837-1862 The “Free Banking Era” there was no formal central bank in the US, and banks issued their own notes again
1838 First Telegram sent using Morse Code across 3 km, in 1844 he sent a message across 71 km from Washington DC to Baltimore.
1843 Ada Lovelace published the first algorithm for computing
1844 Modern central bank of England established - meaning only the central bank of England could issue banknotes – prior to that commercial banks could issue their own and were the primary form of currency throughout England
the Bank of England was restricted to issue new banknotes only if they were 100% backed by gold or up to £14 million in government debt.
1848 Communist Manifesto
1850 The first undersea telegraphic communications cable connected France in England after latex produced from the sap of the Palaquium gutta tree in 1845 was proposed as insulation for the underwater cables.
1852 Many countries in Europe build telegram networks, however post remained the primary means of communication to distant countries.
1855 In England fully printed notes that did not require the name of the payee and the cashier's signature first appeared
1855 The printing telegraph made it possible for a machine with 26 alphabetic keys to print the messages automatically and was soon adopted worldwide.
1856 Belgian engineer Charles Bourseul proposed telephony
1856 The Atlantic Telegraph company was formed in London to stretch a commercial telegraph cable across the Atlantic Ocean, completed in 1866.
1860 The Pony Express was founded, able to deliver mail of wealthy individuals or government officials from coast to coast in 10 days.
1861 The East coast was connected to the West when Western Union completed the transcontinental telegraph line, putting an end to unprofitable The Pony Express.
1862-1863 First US banknotes - Lincoln Over Rules Debt-Based Money and Issues Greenbacks to Fund Civil War
Bankers would only lend the government money under certain conditions and at high interest rates, so Lincoln issued his own currency – “greenbacks” – through the US Treasury, and made them legal tender. His soldiers went on to win the war, followed by great economic expansion.
1863 to 1932 “National Banking Era” Commercial banks in the United States had legally issued banknotes before there was a national currency; however, these became subject to government authorization from 1863 to 1932
1864 Friedrich Wilhelm Raiffeisen founded the first rural credit union in Heddesdorf (now part of Neuwied) in Germany. By the time of Raiffeisen's death in 1888, credit unions had spread to Italy, France, the Netherlands, England, Austria, and other nations
1870 Long-distance telegraph lines connected Britain and India.
c1871 Marginalism - The doctrines of marginalism and the Marginal Revolution are often interpreted as a response to the rise of the worker's movement, Marxian economics and the earlier (Ricardian) socialist theories of the exploitation of labour.
1871 Carl Menger’s Principles of Economics – Austrian School
1872 Marx’s Das Capital
1872 Australia becomes the first nation to be connected to the rest of the world via submarine telegraph cables.
1876 Alexander Graham Bell patented the telephone, first called the electric speech machine – revolutionized communication
1877 Thomas Edison – Phonograph
1878 Western Union, the leading telegraph provider of the U.S., begins to lose out to the telephone technology of the National Bell Telephone Company.
1881 President James Garfield, Staunch Proponent of “Honest Money” Backed by Gold and Silver, was Assassinated
Garfield opposed fiat currency (money that was not backed by any physical object). He had the second shortest Presidency in history.
1882 First description of the one-time pad
1886 First gas powered car
1888 Ballpoint pen
1892 Cinematograph
1895 System of wireless communication using radio waves
1896 First successful intercontinental telegram
1898 Polyethylene
1899 Nickel-cadmium battery
1907 Banking Panic of 1907
The New York Stock Exchange dropped dramatically as everyone tried to get their money out of the banks at the same time across the nation. This banking panic spurred debate for banking reform. JP Morgan and others gathered to create an image of concern and stability in the face of the panic, which eventually led to the formation of the Federal Reserve. The founders of the Federal Reserve pretended like the bankers were opposed to the idea of its formation in order to mislead the public into believing that the Federal Reserve would help to regulate bankers when in fact it really gave even more power to private bankers, but in a less transparent way.
1908 St Mary’s Bank – first credit union in US
1908 JP Morgan Associate and Rockefeller Relative Nelson Aldrich Heads New National Monetary Commission
Senate Republican leader, Nelson Aldrich, heads the new National Monetary Commission that was created to study the cause of the banking panic. Aldrich had close ties with J.P. Morgan and his daughter married John D. Rockefeller.
1910 Bankers Meet Secretly on Jekyll Island to Draft Federal Reserve Banking Legislation
Over the course of a week, some of the nation’s most powerful bankers met secretly off the coast of Georgia, drafting a proposal for a private Central Banking system.
1913 Federal Reserve Act Passed
Two days before Christmas, while many members of Congress were away on vacation, the Federal Reserve Act was passed, creating the Central banking system we have today, originally with gold backed Federal Reserve Notes. It was based on the Aldrich plan drafted on Jekyll Island and gave private bankers supreme authority over the economy. They are now able to create money out of nothing (and loan it out at interest), make decisions without government approval, and control the amount of money in circulation.
1913 Income tax established -16th Amendment Ratified
Taxes ensured that citizens would cover the payment of debt due to the Central Bank, the Federal Reserve, which was also created in 1913.The 16th Amendment stated: “The Congress shall have power to lay and collect taxes on incomes, from whatever source derived, without apportionment among the several States, and without regard to any census or enumeration.”
1914 November, Federal Reserve Banks Open
JP Morgan and Co. Profits from Financing both sides of War and Purchasing Weapons
J.P. Morgan and Co. made a deal with the Bank of England to give them a monopoly on underwriting war bonds for the UK and France. They also invested in the suppliers of war equipment to Britain and France.
1914 WWI
1917 Teletype cipher
1917 The one-time pad
1917 Zimmerman Telegram intercepted and decoded by Room 40, the cryptanalysis department of the British Military during WWI.
1918 GB returns to gold standard post-war but it didn’t work out
1919 First rotor machine, an electro-mechanical stream ciphering and decrypting machine.
1919 Founding of The Cipher Bureau, Poland’s intelligence and cryptography agency.
1919-1929 The Black Chamber, a forerunner of the NSA, was the first U.S. cryptanalytic organization. Worked with the telegraph company Western Union to illegally acquire foreign communications of foreign embassies and representatives. It was shut down in 1929 as funding was removed after it was deemed unethical to intercept private domestic radio signals.
1920s Department stores, hotel chains and service staions begin offering customers charge cards
1921-1929 The “Roaring 20’s” – The Federal Reserve Floods the Economy with Cash and Credit
From 1921 to 1929 the Federal Reserve increased the money supply by $28 billion, almost a 62% increase over an eight-year period.[3] This artificially created another “boom”.
1927 Quartz clock
1928 First experimental Television broadcast in the US.
1929 Federal Reserve Contracts the Money Supply
In 1929, the Federal Reserve began to pull money out of circulation as loans were paid back. They created a “bust” which was inevitable after issuing so much credit in the years before. The Federal Reserve’s actions triggered the banking crisis, which led to the Great Depression.
1929 October 24, “Black Thursday”, Stock Market Crash
The most devastating stock market crash in history. Billions of dollars in value were consolidated into the private banker’s hands at the expense of everyone else.
1930s The Great Depression marked the end of the gold standard
1931 German Enigma machines attained and reconstructed.
1932 Turbo jet engine patented
1933 SEC founded - passed the Glass–Steagall Act, which separated investment banking and commercial banking. This was to avoid more risky investment banking activities from ever again causing commercial bank failures.
1933 FM Radio
1933 Germany begins Telex, a network of teleprinters sending and receiving text based messages. Post WWII Telex networks began to spread around the world.
1936 Austrian engineer Paul Eisler invented Printed circuit board
1936 Beginning of the Keynesian Revolution
1937 Typex, British encryption machines which were upgraded versions of Enigma machines.
1906 Teletypewriters
1927 Founding of highly secret and unofficial Signal Intelligence Service, SIS, the U.S. Army’s codebreaking division.
1937 Made illegal for Americans to own gold
1938 Z1 built by Konrad Zuse is the first freely programmable computer in the world.
1939 WWII – decline of the gold standard which greatly restricted policy making
1939-45 Codetalkers - The Navajo code is the only spoken military code never to have been deciphered - "Were it not for the Navajos, the Marines would never have taken Iwo Jima."—Howard Connor
1940 Modems
1942 Deciphering Japanese coded messages leads to a turning point victory for the U.S. in WWII.
1943 At Bletchley Park, Alan Turing and team build a specialized cipher-breaking machine called Heath Robinson.
1943 Colossus computer built in London to crack the German Lorenz cipher.
1944 Bretton Woods – convenient after the US had most of the gold
1945 Manhattan Project – Atom Bomb
1945 Transatlantic telephone cable
1945 Claude E. Shannon published "A mathematical theory of cryptography", commonly accepted as the starting point for development of modern cryptography.
C1946 Crypto Wars begin and last to this day
1946 Charg-it card created by John C Biggins
1948 Atomic clock
1948 Claude Shannon writes a paper that establishes the mathematical basis of information theory
1949 Info theorist Claude Shannon asks “What does an ideal cipher look like?” – one time pad – what if the keys are not truly random
1950 First credit card released by the Diners Club, able to be used in 20 restaurants in NYC
1951 NSA, National Security Agency founded and creates the KL-7, an off-line rotor encryption machine
1952 First thermonuclear weapon
1953 First videotape recorder
1953 Term “Hash” first used meaning to “chop” or “make a mess” out of something
1954 Atomic Energy Act (no mention of crypto)
1957 The NSA begins producing ROMOLUS encryption machines, soon to be used by NATO
1957 First PC – IBM
1957 First Satellite – Sputnik 1
1958 Western Union begins building a nationwide Telex network in the U.S.
1960s Machine readable codes were added to the bottom of cheques in MICR format, which speeded up the clearing and sorting process
1960s Financial organizations were beginning to require strong commercial encryption on the rapidly growing field of wired money transfer.
1961 Electronic clock
1963 June 4, Kennedy Issued an Executive Order (11110) that Authorized the US Treasury to Issue Silver Certificates, Threatening the Federal Reserve’s Monopoly on Money
This government issued currency would bypass the governments need to borrow from bankers at interest.
1963 Electronic calculator
1963 Nov. 22, Kennedy Assassinated
1963 Johnson Reverses Kennedy’s Banking Rule and Restores Power to the Federal Reserve
1964 8-Track
1964 LAN, Local Area Networks adapters
1965 Moore’s Law by CEO of Intel Gordon Moore observes that the number of components per integrated circuit doubles every year, and projected this rate of growth would continue for at least another decade. In 1975 he revised it to every two years.
1967 First ATM installed at Barclay’s Bank in London
1968 Cassette Player introduced
1969 First connections of ARPANET, predecessor of the internet, are made. started – SF, SB, UCLA, Utah (now Darpa) – made to stay ahead of the Soviets – there were other networks being built around the world but it was very hard to connect them – CERN in Europe
1970s Stagflation – unemployment + inflation, which Keynesian theory could not explain
1970s Business/commercial applications for Crypto emerge – prior to this time it was militarily used – ATMs 1st got people thinking about commercial applications of cryptography – data being sent over telephone lines
1970s The public developments of the 1970s broke the near monopoly on high quality cryptography held by government organizations.
Use of checks increased in 70s – bringing about ACH
One way functions...
A few companies began selling access to private networks – but weren’t allowed to connect to the internet – business and universities using Arpanet had no commercial traffic – internet was used for research, not for commerce or advertising
1970 Railroads threatened by the growing popularity of air travel. Penn Central Railroad declares bankruptcy resulting in a $3.2 billion bailout
1970 Conjugate coding used in an attempt to design “money physically impossible to counterfeit”
1971 The US officially removes the gold standard
1971 Email invented
1971 Email
1971 First microcomputer on a chip
1971 Lockheed Bailout - $1.4 billion – Lockheed was a major government defense contractor
1972 First programmable word processor
1972 First video game console
1973 SWIFT established
1973 Ethernet invented, standardized in ‘83
1973 Mobile phone
1973 First commercial GUI – Xerox Alto
1973 First touchscreen
1973 Emails made up more than ¾ of ARPANET’s packets – people had to keep a map of the network by their desk – so DNS was created
1974 A protocol for packet network intercommunication – TCP/IP – Cerf and Kahn
1974 Franklin National Bank Bailout - $1.5 billion (valued at that time) - At the time, it was the largest bank failure in US history
1975 New York City Bailout - $9.4 billion – NYC was overextended
1975 W DES - meant that commercial uses of high quality encryption would become common, and serious problems of export control began to arise.
1975 DES, Data Encryption Standard developed at IBM, seeking to develop secure electronic communications for banks and large financial organizations. DES was the first publicly accessible cipher to be 'blessed' by a national agency such as the NSA. Its release stimulated an explosion of public and academic interest in cryptography.
1975 Digital camera
1975 Altair 8800 sparks the microprocessor revolution
1976 Bretton Woods ratified (lasted 30 years) – by 80’s all nations were using floating currencies
1976 New Directions in Cryptography published by Diffie & Hellman – this terrified Fort Meade – previously this technique was classified, now it’s public
1976 Apple I Computer – Steve Wozniak
1976 Asymmetric key cryptosystem published by Whitfield Diffie and Martin Hellman.
1976 Hellman and Diffie publish New Directions in Cryptography, introducing a radically new method of distributing cryptographic keys, contributing much to solving key distribution one of the fundamental problems of cryptography. It brought about the almost immediate public development of asymmetric key algorithms. - where people can have 2 sets of keys, public and private
1977 Diffie & Hellman receive letter from NSA employee JA Meyer that they’re violating Federal Laws comparable to arms export – this raises the question, “Can the gov prevent academics from publishing on crypto?
1977 DES considered insecure
1977 First handheld electronic game
1977 RSA public key encryption invented
1978 McEliece Cryptosystem invented, first asymmetric encryption algorithm to use randomization in the encryption process
1980s Large data centers began being built to store files and give users a better faster experience – companies rented space from them - Data centers would not only store data but scour it to show people what they might want to see and in some cases, sell data
1980s Reaganomics and Thatcherism
1980 A decade of intense bank failures begins; the FDIC reports that 1,600 were either closed or received financial assistance from 1980 to 1994
1980 Chrysler Bailout – lost over $1 billion due to major hubris on the part of its executives - $1.5 billion one of the largest payouts ever made to a single corporation.
1980 Protocols for public key cryptosystems – Ralph Merkle
1980 Flash memory invented – public in ‘84
1981 “Untraceable Electronic Mail, Return Addresses and Digital Pseudonumns” – Chaum
1981 EFTPOS, Electronic funds transfer at point of sale is created
1981 IBM Personal Computer
1982 “The Ethics of Liberty” Murray Rothbard
1982 Commodore 64
1982 CD
1983 Satellite TV
1983 First built in hard drive
1983 C++
1983 Stereolithography
1983 Blind signatures for untraceable payments
Mid 1980s Use of ATMs becomes more widespread
1984 Continental Illinois National Bank and Trust bailed out due to overly aggressive lending styles and - the bank’s downfall could be directly traced to risk taking and a lack of due diligence on the part of bank officers - $9.5 billion in 2008 money
1984 Macintosh Computer - the first mass-market personal computer that featured a graphical user interface, built-in screen and mouse
1984 CD Rom
1985 Zero-Knowledge Proofs first proposed
1985 300,000 simultaneous telephone conversations over single optical fiber
1985 Elliptic Curve Cryptography
1987 ARPANET had connected over 20k guarded computers by this time
1988 First private networks email servers connected to NSFNET
1988 The Crypto Anarchists Manifesto – Timothy C May
1988 ISDN, Integrated Services Digital Network
1989 Savings & Loan Bailout - After the widespread failure of savings and loan institutions, President George H. W. Bush signed and Congress enacted the Financial Institutions Reform Recovery and Enforcement Act - This was a taxpayer bailout of about $200 billion
1989 First commercial emails sent
1989 Digicash - Chaum
1989 Tim Berners-Lee and Robert Cailliau built the prototype system which became the World Wide Web, WWW
1989 First ISPs – companies with no network of their own which connected people to a local network and to the internet - To connect to a network your computer placed a phone call through a modem which translated analog signals to digital signals – dial-up was used to connect computers as phone lines already had an extensive network across the U.S. – but phone lines weren’t designed for high pitched sounds that could change fast to transmit large amounts of data
1990s Cryptowars really heat up...
1990s Some countries started to change their laws to allow "truncation"
1990s Encryption export controls became a matter of public concern with the introduction of the personal computer. Phil Zimmermann's PGP cryptosystem and its distribution on the Internet in 1991 was the first major 'individual level' challenge to controls on export of cryptography. The growth of electronic commerce in the 1990s created additional pressure for reduced restrictions.[3] Shortly afterward, Netscape's SSL technology was widely adopted as a method for protecting credit card transactions using public key cryptography.
1990 NSFNET replaced Arpanet as backbone of the internet with more than 500k users
Early 90s Dial up provided through AOL and Compuserve
People were leery to use credit cards on the internet
1991 How to time-stamp a digital doc - Stornetta
1991 Phil Zimmermann releases the public key encryption program Pretty Good Privacy (PGP) along with its source code, which quickly appears on the Internet. He distributed a freeware version of PGP when he felt threatened by legislation then under consideration by the US Government that would require backdoors to be included in all cryptographic products developed within the US. Expanded the market to include anyone wanting to use cryptography on a personal computer (before only military, governments, large corporations)
1991 WWW (Tim Berners Lee) – made public in ‘93 – flatten the “tree” structure of the internet using hypertext – reason for HTTP//:WWW – LATER HTTPS for more security
1992 Erwise – first Internet Browser w a graphical Interface
1992 Congress passed a law allowing for commercial traffic on NSFNET
1992 Cpherpunks, Eric Hughes, Tim C May and John Gilmore – online privacy and safety from gov – cypherpunks write code so it can be spread and not shut down (in my earlier chapter)
1993 Mosaic – popularized surfing the web ‘til Netscape Navigator in ’94 – whose code was later used in Firefox
1993 A Cypherpunks Manifesto – Eric Hughes
1994 World’s first online cyberbank, First Virtual, opened for business
1994 Bluetooth
1994 First DVD player
1994 Stanford Federal Credit Union becomes the first financial institution to offer online internet banking services to all of its members in October 1994
1994 Internet only used by a few
1994 Cybercash
1994 Secure Sockets Layer (SSL) encryption protocol released by Netscape. Making financial transactions possible.
1994 One of the first online purchases was made, a Pizza Hut pepperoni pizza with mushrooms and extra cheese
1994 Cyphernomicon published – social implication where gov can’t do anything about it
1994-1999 Social Networking – GeoCities (combining creators and users) – had 19M users by ’99 – 3rd most popular after AOL and Yahoo – GeoCities purchased by Yahoo for $3.6B but took a hit after dotcom bubble popped and never recovered – GC shut down in ‘99
1995-2000 Dotcom bubble – Google, Amazon, Facebook: get over 600M visitors/year
1995 DVD
1995 MP3 term coined for MP3 files, the earlier development of which stretches back into the ‘70s, where MP files themselves where developed throughout the ‘90s
1995 NSFNET shut down and handed everything over to the ISPs
1995 NSA publishes the SHA1 hash algorithm as part of its Digital Signature Standard.
1996, 2000 President Bill Clinton signing the Executive order 13026 transferring the commercial encryption from the Munition List to the Commerce Control List. This order permitted the United States Department of Commerce to implement rules that greatly simplified the export of proprietary and open source software containing cryptography, which they did in 2000 - The successful cracking of DES likely helped gather both political and technical support for more advanced encryption in the hands of ordinary citizens - NSA considers AES strong enough to protect information classified at the Top Secret level
1996 e-gold
1997 WAP, Wireless Access Point
1997 NSA researchers published how to mint e cash
1997 Adam Back – HashCash – used PoW – coins could only be used once
1997 Nick Szabo – smart contracts “Formalizing and Securing Relationships on Public Networks”
1998 OSS, Open-source software Initiative Founded
1998 Wei Dai – B-money – decentralized database to record txs
1998 Bitgold
1998 First backdoor created by hackers from Cult of the Dead Cow
1998 Musk and Thiel founded PayPal
1998 Nick Szabo says crypto can protect land titles even if thugs take it by force – said it could be done with a timestamped database
1999 Much of the Glass-Steagal Act repealed - this saw US retail banks embark on big rounds of mergers and acquisitions and also engage in investment banking activities.
1999 Milton Friedman says, “I think that the Internet is going to be one of the major forces for reducing the role of government. The one thing that's missing, but that will soon be developed, is a reliable e-cash - a method whereby on the Internet you can transfer funds from A to B without A knowing B or B knowing A.”
1999 European banks began offering mobile banking with the first smartphones
1999 The Financial Services Modernization Act Allows Banks to Grow Even Larger
Many economists and politicians have recognized that this legislation played a key part in the subprime mortgage crisis of 2007.
1999-2001 Napster, P2P file sharing – was one of the fastest growing businesses in history – bankrupt for paying musicians for copyright infringement

submitted by crypto_jedi_ninja to Bitcoin [link] [comments]

Compact Multi-Signatures for Smaller Blockchains

Cryptology ePrint Archive: Report 2018/483
Date: 2018-06-10
Author(s): Dan Boneh, Manu Drijvers, Gregory Neven

Link to Paper


Abstract
We construct new multi-signature schemes that provide new functionality. Our schemes are designed to reduce the size of the Bitcoin blockchain, but are useful in many other settings where multi-signatures are needed. All our constructions support both signature compression and public-key aggregation. Hence, to verify that a number of parties signed a common message m, the verifier only needs a short multi-signature, a short aggregation of their public keys, and the message m. We give new constructions that are derived from Schnorr signatures and from BLS signatures. Our constructions are in the plain public key model, meaning that users do not need to prove knowledge or possession of their secret key.
In addition, we construct the first short accountable-subgroup multi-signature (ASM) scheme. An ASM scheme enables any subset S of a set of n parties to sign a message m so that a valid signature discloses which subset generated the signature (hence the subset S is accountable for signing m). We construct the first ASM scheme where signature size is only O(k) bits over the description of S, where k is the security parameter. Similarly, the aggregate public key is only O(k) bits, independent of n. The signing process is non-interactive. Our ASM scheme is very practical and well suited for compressing the data needed to spend funds from a t-of-n Multisig Bitcoin address, for any (polynomial size) t and n.

References
  1. Ahn, J.H., Green, M., Hohenberger, S.: Synchronized aggregate signatures: new definitions, constructions and applications. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 10: 17th Conference on Computer and Communications Security. pp. 473–484. ACM Press, Chicago, Illinois, USA (Oct 4–8, 2010)
  2. Andresen, G.: m-of-n standard transactions. Bitcoin improvement proposal (BIP) 0011 (2011)
  3. Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 08: 15th Conference on Computer and Communications Security. pp. 449–458. ACM Press, Alexandria, Virginia, USA (Oct 27–31, 2008)
  4. Bagherzandi, A., Jarecki, S.: Multisignatures using proofs of secret key possession, as secure as the Diffie-Hellman problem. In: Ostrovsky, R., Prisco, R.D., Visconti, I. (eds.) SCN 08: 6th International Conference on Security in Communication Networks. Lecture Notes in Computer Science, vol. 5229, pp. 218–235. Springer, Heidelberg, Germany, Amalfi, Italy (Sep 10–12, 2008)
  5. Bansarkhani, R.E., Sturm, J.: An efficient lattice-based multisignature scheme with applications to bitcoins. In: Foresti, S., Persiano, G. (eds.) CANS 16: 15th International Conference on Cryptology and Network Security. Lecture Notes in Computer Science, vol. 10052, pp. 140–155. Springer, Heidelberg, Germany, Milan, Italy (Nov 14–16, 2016)
  6. Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003: 10th Annual International Workshop on Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 3006, pp. 17–25. Springer, Heidelberg, Germany, Ottawa, Ontario, Canada (Aug 14–15, 2004)
  7. Bellare, M., Namprempre, C., Neven, G.: Unrestricted aggregate signatures. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.) ICALP 2007: 34th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 4596, pp. 411–422. Springer, Heidelberg, Germany, Wroclaw, Poland (Jul 9–13, 2007)
  8. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-RSAinversion problems and the security of Chaum’s blind signature scheme. Journal of Cryptology 16(3), 185–215 (Jun 2003)
  9. Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Juels, A., Wright, R.N., Vimercati, S. (eds.) ACM CCS 06: 13th Conference on Computer and Communications Security. pp. 390–399. ACM Press, Alexandria, Virginia, USA (Oct 30 – Nov 3, 2006)
  10. Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC 2003: 6th International Workshop on Theory and Practice in Public Key Cryptography. Lecture Notes in Computer Science, vol. 2567, pp. 31–46. Springer, Heidelberg, Germany, Miami, FL, USA (Jan 6–8, 2003)
  11. Boldyreva, A., Gentry, C., O’Neill, A., Yum, D.H.: Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM CCS 07: 14th Conference on Computer and Communications Security. pp. 276–285. ACM Press, Alexandria, Virginia, USA (Oct 28–31, 2007)
  12. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) Advances in Cryptology – EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 416–432. Springer, Heidelberg, Germany, Warsaw, Poland (May 4–8, 2003)
  13. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) Advances in Cryptology – ASIACRYPT 2001. Lecture Notes in Computer Science, vol. 2248, pp. 514–532. Springer, Heidelberg, Germany, Gold Coast, Australia (Dec 9–13, 2001)
  14. Brogle, K., Goldberg, S., Reyzin, L.: Sequential aggregate signatures with lazy verification from trapdoor permutations - (extended abstract). In: Wang, X., Sako, K. (eds.) Advances in Cryptology – ASIACRYPT 2012. Lecture Notes in Computer Science, vol. 7658, pp. 644–662. Springer, Heidelberg, Germany, Beijing, China (Dec 2–6, 2012)
  15. Budroni, A., Pintore, F.: Efficient hash maps to G2 on BLS curves. Cryptology ePrint Archive, Report 2017/419 (2017), http://eprint.iacr.org/2017/419
  16. Burmester, M., Desmedt, Y., Doi, H., Mambo, M., Okamoto, E., Tada, M., Yoshifuji, Y.: A structured ElGamal-type multisignature scheme. In: Imai, H., Zheng, Y. (eds.) PKC 2000: 3rd International Workshop on Theory and Practice in Public Key Cryptography. Lecture Notes in Computer Science, vol. 1751, pp. 466–483. Springer, Heidelberg, Germany, Melbourne, Victoria, Australia (Jan 18–20, 2000)
  17. Castelluccia, C., Jarecki, S., Kim, J., Tsudik, G.: A robust multisignatures scheme with applications to acknowledgment aggregation. In: Blundo, C., Cimato, S. (eds.) SCN 04: 4th International Conference on Security in Communication Networks. Lecture Notes in Computer Science, vol. 3352, pp. 193–207. Springer, Heidelberg, Germany, Amalfi, Italy (Sep 8–10, 2005)
  18. Certicom Research: Sec 2: Recommended elliptic curve domain parameters. Tech. rep., Certicom Research (2010)
  19. Chang, C.C., Leu, J.J., Huang, P.C., Lee, W.B.: A scheme for obtaining a message from the digital multisignature. In: Imai, H., Zheng, Y. (eds.) PKC’98: 1st International Workshop on Theory and Practice in Public Key Cryptography. Lecture Notes in Computer Science, vol. 1431, pp. 154–163. Springer, Heidelberg, Germany, Pacifico Yokohama, Japan (Feb 5–6, 1998)
  20. Coron, J.S., Naccache, D.: Boneh et al.’s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In: Laih, C.S. (ed.) Advances in Cryptology – ASIACRYPT 2003. Lecture Notes in Computer Science, vol. 2894, pp. 392–397. Springer, Heidelberg, Germany, Taipei, Taiwan (Nov 30 – Dec 4, 2003)
  21. Drijvers, M., EdalatNejad, K., Ford, B., Neven, G.: Okamoto beats Schnorr: On the provable security of multi-signatures. Cryptology ePrint Archive, Report 2018/417 (2018), https://eprint.iacr.org/2018/417
  22. Fuentes-Casta˜neda, L., Knapp, E., Rodr´ıguez-Henr´ıquez, F.: Faster hashing to ð2. In: Miri, A., Vaudenay, S. (eds.) SAC 2011: 18th Annual International Workshop on Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 7118, pp. 412–430. Springer, Heidelberg, Germany, Toronto, Ontario, Canada (Aug 11–12, 2012)
  23. Gentry, C., O’Neill, A., Reyzin, L.: A unified framework for trapdoor-permutationbased sequential aggregate signatures. In: Abdalla, M., Dahab, R. (eds.) PKC 2018: 21st International Conference on Theory and Practice of Public Key Cryptography, Part II. Lecture Notes in Computer Science, vol. 10770, pp. 34–57. Springer, Heidelberg, Germany, Rio de Janeiro, Brazil (Mar 25–29, 2018)
  24. Gentry, C., Ramzan, Z.: Identity-based aggregate signatures. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006: 9th International Conference on Theory and Practice of Public Key Cryptography. Lecture Notes in Computer Science, vol. 3958, pp. 257–273. Springer, Heidelberg, Germany, New York, NY, USA (Apr 24–26, 2006)
  25. Hardjono, T., Zheng, Y.: A practical digital multisignature scheme based on discrete logarithms. In: Seberry, J., Zheng, Y. (eds.) Advances in Cryptology – AUSCRYPT’92. Lecture Notes in Computer Science, vol. 718, pp. 122–132. Springer, Heidelberg, Germany, Gold Coast, Queensland, Australia (Dec 13–16, 1993)
  26. Harn, L.: Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proceedings-Computers and Digital Techniques 141(5), 307–313 (1994)
  27. Horster, P., Michels, M., Petersen, H.: Meta-multisignature schemes based on the discrete logarithm problem. In: Information Securitythe Next Decade. pp. 128–142. Springer (1995)
  28. Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. Tech. rep., NEC Research and Development (1983)
  29. Komano, Y., Ohta, K., Shimbo, A., Kawamura, S.: Formal security model of multisignatures. In: Katsikas, S.K., Lopez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006: 9th International Conference on Information Security. Lecture Notes in Computer Science, vol. 4176, pp. 146–160. Springer, Heidelberg, Germany, Samos Island, Greece (Aug 30 – Sep 2, 2006)
  30. Le, D.P., Bonnecaze, A., Gabillon, A.: Multisignatures as secure as the DiffieHellman problem in the plain public-key model. In: Shacham, H., Waters, B. (eds.) PAIRING 2009: 3rd International Conference on Pairing-based Cryptography. Lecture Notes in Computer Science, vol. 5671, pp. 35–51. Springer, Heidelberg, Germany, Palo Alto, CA, USA (Aug 12–14, 2009)
  31. Li, C.M., Hwang, T., Lee, N.Y.: Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders. In: Santis, A.D. (ed.) Advances in Cryptology – EUROCRYPT’94. Lecture Notes in Computer Science, vol. 950, pp. 194–204. Springer, Heidelberg, Germany, Perugia, Italy (May 9–12, 1995)
  32. Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) Advances in Cryptology – EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 465–485. Springer, Heidelberg, Germany, St. Petersburg, Russia (May 28 – Jun 1, 2006)
  33. Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology – EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 74–90. Springer, Heidelberg, Germany, Interlaken, Switzerland (May 2–6, 2004)
  34. Ma, C., Weng, J., Li, Y., Deng, R.: Efficient discrete logarithm based multisignature scheme in the plain public key model. Designs, Codes and Cryptography 54(2), 121–133 (2010)
  35. Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple schnorr multi-signatures with applications to bitcoin. Cryptology ePrint Archive, Report 2018/068 (2018), https://eprint.iacr.org/2018/068/20180118:124757
  36. Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple schnorr multi-signatures with applications to bitcoin. Cryptology ePrint Archive, Report 2018/068 (2018), https://eprint.iacr.org/2018/068/20180520:191909
  37. Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) Advances in Cryptology – CRYPTO’87. Lecture Notes in Computer Science, vol. 293, pp. 369–378. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 16–20, 1988)
  38. Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: Extended abstract. In: ACM CCS 01: 8th Conference on Computer and Communications Security. pp. 245–254. ACM Press, Philadelphia, PA, USA (Nov 5–8, 2001)
  39. Michels, M., Horster, P.: On the risk of disruption in several multiparty signature schemes. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 334–345. Springer (1996)
  40. Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008), http://bitcoin.org/bitcoin.pdf
  41. Neven, G.: Efficient sequential aggregate signed data. In: Smart, N.P. (ed.) Advances in Cryptology – EUROCRYPT 2008. Lecture Notes in Computer Science, vol. 4965, pp. 52–69. Springer, Heidelberg, Germany, Istanbul, Turkey (Apr 13–17, 2008)
  42. Ohta, K., Okamoto, T.: A digital multisignature scheme based on the Fiat-Shamir scheme. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds.) Advances in Cryptology – ASIACRYPT’91. Lecture Notes in Computer Science, vol. 739, pp. 139–148. Springer, Heidelberg, Germany, Fujiyoshida, Japan (Nov 11–14, 1993)
  43. Ohta, K., Okamoto, T.: Multi-signature schemes secure against active insider attacks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 82(1), 21–31 (1999)
  44. Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) Advances in Cryptology – CRYPTO’92. Lecture Notes in Computer Science, vol. 740, pp. 31–53. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (Aug 16–20, 1993)
  45. Park, S., Park, S., Kim, K., Won, D.: Two efficient RSA multisignature schemes. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 97: 1st International Conference on Information and Communication Security. Lecture Notes in Computer Science, vol. 1334, pp. 217–222. Springer, Heidelberg, Germany, Beijing, China (Nov 11–14, 1997)
  46. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)
  47. Ristenpart, T., Yilek, S.: The power of proofs-of-possession: Securing multiparty signatures against rogue-key attacks. In: Naor, M. (ed.) Advances in Cryptology – EUROCRYPT 2007. Lecture Notes in Computer Science, vol. 4515, pp. 228–245. Springer, Heidelberg, Germany, Barcelona, Spain (May 20–24, 2007)
  48. Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4(3), 161–174 (1991)
  49. Scott, M., Benger, N., Charlemagne, M., Perez, L.J.D., Kachisa, E.J.: Fast hashing to g2 on pairing-friendly curves. In: Shacham, H., Waters, B. (eds.) PAIRING 2009: 3rd International Conference on Pairing-based Cryptography. Lecture Notes in Computer Science, vol. 5671, pp. 102–113. Springer, Heidelberg, Germany, Palo Alto, CA, USA (Aug 12–14, 2009)
submitted by dj-gutz to myrXiv [link] [comments]

Minimizing Trust in Hardware Wallets with Two Factor Signatures

Cryptology ePrint Archive: Report 2019/006
Date: 2019-01-02
Author(s): Antonio Marcedone, Rafael Pass, abhi shelat

Link to Paper


Abstract
We introduce the notion of two-factor signatures (2FS), a generalization of a two-out-of-two threshold signature scheme in which one of the parties is a hardware token which can store a high-entropy secret, and the other party is a human who knows a low-entropy password. The security (unforgeability) property of 2FS requires that an external adversary corrupting either party (the token or the computer the human is using) cannot forge a signature. This primitive is useful in contexts like hardware cryptocurrency wallets in which a signature conveys the authorization of a transaction. By the above security property, a hardware wallet implementing a two-factor signature scheme is secure against attacks mounted by a malicious hardware vendor; in contrast, all currently used wallet systems break under such an attack (and as such are not secure under our definition). We construct efficient provably-secure 2FS schemes which produce either Schnorr signature (assuming the DLOG assumption), or EC-DSA signatures (assuming security of EC-DSA and the CDH assumption) in the Random Oracle Model, and evaluate the performance of implementations of them. Our EC-DSA based 2FS scheme can directly replace currently used hardware wallets for Bitcoin and other major cryptocurrencies to enable security against malicious hardware vendors.

References
[1] Jes´us F Almansa, Ivan Damg˚ard, and Jesper Buus Nielsen. Simplified threshold RSA with adaptive and proactive security. In Eurocrypt, volume 4004, pages 593–611. Springer, 2006.
[2] Dan Boneh, Xuhua Ding, Gene Tsudik, and Chi-Ming Wong. A method for fast revocation of public key certificates and security capabilities. In USENIX Security Symposium, pages 22–22, 2001.
[3] Jan Camenisch, Anja Lehmann, Gregory Neven, and Kai Samelin. Virtual smart cards: how to sign with a password and a server, 2016.
[4] Yvo Desmedt and Yair Frankel. Threshold cryptosystems. In Advances in Cryptology – CRYPTO 1989, pages 307–315. Springer, 1990.
[5] J. Doerner, Y. Kondi, E. Lee, and a. shelat. Secure two-party threshold ECDSA from ECDSA assumptions. In 2018 IEEE Symposium on Security and Privacy (SP), pages 595–612, 2018.
[6] Rosario Gennaro and Steven Goldfeder. Fast multiparty threshold ecdsa with fast trustless setup. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 1179–1194. ACM, 2018.
[7] Rosario Gennaro, Stanis law Jarecki, Hugo Krawczyk, and Tal Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology – CRYPTO 1996, pages 157–172. Springer, 1996.
[8] Steven Goldfeder, Rosario Gennaro, Harry Kalodner, Joseph Bonneau, Joshua A Kroll, Edward W Felten, and Arvind Narayanan. Securing bitcoin wallets via a new DSA/ECDSA threshold signature scheme, 2015.
[9] Yehuda Lindell. Fast secure two-party ECDSA signing. In Advances in Cryptology – CRYPTO 2017, pages 613–644. Springer, 2017.
[10] Yehuda Lindell and Ariel Nof. Fast secure multiparty ecdsa with practical distributed key generation and applications to cryptocurrency custody. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 1837–1854. ACM, 2018.
[11] Philip MacKenzie and Michael K Reiter. Delegation of cryptographic servers for capture-resilient devices. Distributed Computing, 16(4):307–327, 2003.
[12] Philip MacKenzie and Michael K Reiter. Networked cryptographic devices resilient to capture. International Journal of Information Security, 2(1):1–20, 2003.
[13] Antonio Marcedone, Rafael Pass, and abhi shelat. Minimizing trust in hardware wallets with two factor signatures. Cryptology ePrint Archive, Report 2018/???, 2018.
[14] Microchip. Atecc608a datasheet, 2018.
[15] Antonio Nicolosi, Maxwell N Krohn, Yevgeniy Dodis, and David Mazieres. Proactive two-party signatures for user authentication. In NDSS, 2003.
[16] Marek Palatinus, Pavol Rusnak, Aaron Voisine, and Sean Bowe. Mnemonic code for generating deterministic keys (bip39). https://github.com/bitcoin/bips/blob/mastebip-0039.mediawiki.
[17] Tal Rabin. A simplified approach to threshold and proactive RSA. In Advances in Cryptology – CRYPTO 1998, pages 89–104. Springer, 1998.
[18] T.C. Sottek. Nsa reportedly intercepting laptops purchased online to install spy malware, December 2013. [Online; posted 29-December-2013; https://www.theverge.com/2013/12/29/5253226/nsacia-fbi-laptop-usb-plant-spy].
submitted by dj-gutz to myrXiv [link] [comments]

Please read our Frequently Asked Questions (FAQ)

What is CDY?
Bitcoin Candy(CDY) is a new chain forked from Bitcoin Cash at the height of 512666. The original BCH holders will be compensated with 1000 CDY for every BCH held. New features will be added to the forked chain and we will explore anti-quantum attacks solution on this chain.
What is anti-quantum attacks thing?
In the past few years, D-Wave, IBM, Intel and other technological giants invest a lot of manpower and resources to increase research and development of quantum computers, i.e., Google have embedded D-Wave quantum computer into its cloud platform; the research team under Prof. Pan Weijian in Chinese University of Technology have made breakthrough achievements in quantum communications. Under such circumstance, the quantum age will no longer stay in science fiction conjecture (perhaps 5-10 years will come).
The development of quantum computer will not only bring great changes to people's lives, but also pose a serious threat to traditional public key cryptography. Public key cryptosystems such as ECDSA and RSA will be solved in polynomial time by these quantum computers. So, virtual currency like Bitcoin which use ECDSA as a signature algorithm will become unsafe. To find post-quantum digital signature algorithm is of vital important.
Our team has a deep post-quantum cryptography background and will conduct research and experiments on the CDY chain for practical public key signature algorithms in the post-quantum-era blockchain. Why forked from BCH, can BTC holders get free CDY?
On August 1, 2017, Bitcoin community finally ended its years-long expansion war by splitting the original bitcoin into two chains, Bitcoin cash (BCH) and segwit Bitcoin (inheriting BTC ticker). We think BCH is more in line with Satoshi Nakamoto's vision of bitcoin "a peer-to-peer electronic cash system" and will have a brighter future. Only who hold BCH at height 512666(about January 13 ) can get free CDY at the rate of 1BCH : 1000CDY. What is the total supply of CDY?
CDY will have a total supply of 21 billion, of which 1% will be pre-mined.
How to claim my free CDY?
To get free CDY, you need to hold Bitcoin Cash before height 512666 (about January 13).
1.If your BCH is stored in a wallet where you can control private key yourself, you will definitely get free CDY. Just waiting for the wallet developer to provide feature to claim.
2.If your BCH is stored in the exchange, the exchange will receive free CDY, please pay attention whether the exchange will provide CDY's collection function or not.If the exchange you store BCH does not support CDY, to avoid the loss of assets it is recommended to withdraw BCH to a wallet which you can contral private key or to exchanges that support CDY.
submitted by momagic to BitcoinCandy [link] [comments]

Please read our Frequently Asked Questions (FAQ)

What is CDY?
Bitcoin Candy(CDY) is a new chain forked from Bitcoin Cash at the height of 512666. The original BCH holders will be compensated with 1000 CDY for every BCH held. New features will be added to the forked chain and we will explore anti-quantum attacks solution on this chain.
What is anti-quantum attacks thing?
In the past few years, D-Wave, IBM, Intel and other technological giants invest a lot of manpower and resources to increase research and development of quantum computers, i.e., Google have embedded D-Wave quantum computer into its cloud platform; the research team under Prof. Pan Weijian in Chinese University of Technology have made breakthrough achievements in quantum communications. Under such circumstance, the quantum age will no longer stay in science fiction conjecture (perhaps 5-10 years will come).
The development of quantum computer will not only bring great changes to people's lives, but also pose a serious threat to traditional public key cryptography. Public key cryptosystems such as ECDSA and RSA will be solved in polynomial time by these quantum computers. So, virtual currency like Bitcoin which use ECDSA as a signature algorithm will become unsafe. To find post-quantum digital signature algorithm is of vital important.
Our team has a deep post-quantum cryptography background and will conduct research and experiments on the CDY chain for practical public key signature algorithms in the post-quantum-era blockchain. Why forked from BCH, can BTC holders get free CDY?
On August 1, 2017, Bitcoin community finally ended its years-long expansion war by splitting the original bitcoin into two chains, Bitcoin cash (BCH) and segwit Bitcoin (inheriting BTC ticker). We think BCH is more in line with Satoshi Nakamoto's vision of bitcoin "a peer-to-peer electronic cash system" and will have a brighter future. Only who hold BCH at height 512666(about January 13 ) can get free CDY at the rate of 1BCH : 1000CDY. What is the total supply of CDY?
CDY will have a total supply of 21 billion, of which 1% will be pre-mined.
How to claim my free CDY?
To get free CDY, you need to hold Bitcoin Cash before height 512666 (about January 13).
1.If your BCH is stored in a wallet where you can control private key yourself, you will definitely get free CDY. Just waiting for the wallet developer to provide feature to claim.
2.If your BCH is stored in the exchange, the exchange will receive free CDY, please pay attention whether the exchange will provide CDY's collection function or not.If the exchange you store BCH does not support CDY, to avoid the loss of assets it is recommended to withdraw BCH to a wallet which you can contral private key or to exchanges that support CDY.
submitted by momagic to CDY [link] [comments]

Mental Poker & Bitcoin

Hello Bitcoin community,
I would like to solicit your input on a project I've been working on: a decentralized, peer-to-peer, cryptographic game of Texas Hold'em poker.
Some of you may recognize the term "Mental Poker", it refers to a late 70s paper from MIT that describes how a fair and verifiable game of poker could be played between two players over a distance.
The authors (founders of RSA Data Security - https://en.wikipedia.org/wiki/RSA_Security#History) ended with the suggestion that their cryptosystem could be extended to more than two players. This suggestion is what I implemented and extended.
With the functional completion of version 1.0 the only remaining tasks are to run some more tests, comment the source code and release it. This version supports dropouts (disconnects) and currently works on a shared buy-in (same starting balance for all players).
There is more history on the CypherPoker subreddit (https://reddit.com/cypherpoker) and technical details may be found on the GitHub Wiki (https://github.com/monicanagent/cypherpokewiki).
Among other tasks, I am now preparing for the process of integrating a cryptocurrency. Bitcoin seems to be the obvious choice which implies using the original Bitcoin daemon (bitcoind). It's my understanding that the most mature multisignature implementation may be found in bitcoind but it's at this point that I would appreciate your input.
Other than bitcoind's multisignature support I'm curious about other known or suspected pitfalls as well as any related feedback or questions that you may have.
Thank you.
submitted by monican_agent to Bitcoin [link] [comments]

Need help with Infographic about evolution of digital security

Hi everybody, I am currently creating an infographic about the evolution of digital security and people who made it happen, where I will put the most influential inventions in chronological order. I try to judge what to include and what not to on the level of impact that each invention made, but I’m afraid that I might have missed something.
Right now my list is as follows: First computer password / Diffie–Hellman key exchange/ RSA (Rivest-Shamir-Adelman)/ Data Encryption Standard (DES)/ ElGamal/ Elliptic curves in cryptography/ Pretty Good Privacy (PGP)/ Digital Signature Algorithm (DSA)/ Blowfish/ HTTPS/ CAPTCHA/ 3DES/ Advanced Encryption Standard (AES) / Rijndael/ GNU Privacy Guard/ Off-the-Record Messaging/ ZRTP (Zimmermann Real-time Transport Protocol)
What I didn’t include: Ipsec/VPN/PFS/PKCS#1/SSL/SSH1/ECDH/Cramer–Shoup system/Paillier cryptosystem/TLS/CAST5/IDEA/RC2/RC4/RC5/RC6/CAST6/Serpent/OpenSSH/ECDSA/S/MIME/SILC/SRTP/SSH2/YAK/XTBitcoin/Twofish
Please tell me if you think that something should be added or excluded. Also, it looks like nothing very noticeable happened in the last 10 years. Please tell me that I am mistaken. Thanks!
submitted by zentrain1 to encryption [link] [comments]

Applied Cryptography RSA Cryptosystem Part 4 Applied Cryptography RSA Cryptosystem Part 5 Mathematical Cryptosystems (1 of 2: Symmetric Cryptography) 2.4.1 RSA Public Key Encryption: Video Cryptography: The Math of the Public Private Key of RSA

Hey guys , I wanted to write a little bit about RSA cryptosystem .. RSA is an asymmetric system , which means that a key pair will be generated (we will see how soon) , a public key and a private key , obviously you keep your private key secure and pass around the public one.. The algorithm was published in the 70’s by Ron Rivest, Adi Shamir, and Leonard Adleman, hence RSA , and it sort of RSA (Rivest–Shamir–Adleman) is one of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and distinct from the decryption key which is kept secret (private). In RSA, this asymmetry is based on the practical difficulty of factoring the product of two large prime numbers, the "factoring problem". RSA is a type of asymmetric cryptographic system that allows people to encrypt a message. Moreover, it permits the receiver of said message to decrypt it. As this is a complex topic, this article will serve as an introduction to the RSA cryptosystem. A cryptosystem is an implementation of cryptographic techniques and their accompanying infrastructure to provide information security services. A cryptosystem is also referred to as a cipher system. Let us discuss a simple model of a cryptosystem that provides confidentiality to the information being transmitted. This Bitcoin is “revolutionary because for the first time the double spending problem can be solved without the need for a third party” [1]. To understand how Bitcoin accomplishes this, we must construct was the RSA public key cryptosystem, devised by Ronald Rivest et al. in 1977. For the full RSA algorithm, please refer to [119]. 2.3.

[index] [10160] [18146] [15099] [7186] [22511] [29432] [24464] [20885] [5213] [13305]

Applied Cryptography RSA Cryptosystem Part 4

In this video I show mathematically for RSA encryption works by going through an example of sending an encrypted message! ... Math Behind Bitcoin and Elliptic Curve ... The RSA Cryptosystem and ... RSA is one of the first practicable public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and differs from the decryption ... Lecture 12: The RSA Cryptosystem and Efficient Exponentiation by Christof Paar - Duration: 1:28:27. Introduction to Cryptography by Christof Paar 92,960 views 1:28:27 For the Love of Physics - Walter Lewin - May 16, 2011 - Duration: 1:01:26. Lectures by Walter Lewin. They will make you ♥ Physics. Recommended for you Lecture 12: The RSA Cryptosystem and Efficient Exponentiation by Christof Paar - Duration: 1:28:27. Introduction to Cryptography by Christof Paar 93,240 views 1:28:27

Flag Counter