|
Secure Multiparty Computation
Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography with the goal of creating methods for parties to jointly compute a function over their inputs while keeping those inputs private. Unlike traditional cryptographic tasks, where cryptography assures security and integrity of communication or storage and the adversary is outside the system of participants (an eavesdropper on the sender and receiver), the cryptography in this model protects participants' privacy from each other. The foundation for secure multi-party computation started in the late 1970s with the work on mental poker, cryptographic work that simulates game playing/computational tasks over distances without requiring a trusted third party. Note that traditionally, cryptography was about concealing content, while this new type of computation and protocol is about concealing partial information about data while comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptography
Cryptography, or cryptology (from grc, , translit=kryptós "hidden, secret"; and ''graphein'', "to write", or ''-logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others. Core concepts related to information security ( data confidentiality, data integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based payment cards, digital currencies, computer passwords, and military communications. Cryptography prior to the modern age was effectively synonymo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Danish Sugar Beet Auction
The Danish Sugar Beet Auction was the first large-scale and practical application of secure multi-party computation, which took place in January 2008. An electronic double auction was successfully run by a multiparty computation involving representatives of Denmark's only sugar beets processor (Danisco), the Danish sugar beet growers' association, and a research group responsible for implementing and running the computation. Due to European Union sugar market policy reforms which reduced sugar subsidies and lowered prices, as well as the recent closure of one of Danisco's sugar processing plants, the Danish sugar beet industry needed to reallocate production contracts to farmers nation-wide in an attempt to retain market efficiency. The decision made was to hold an electronic double auction to find the new market clearing price of sugar beets, where the role of the "auctioneer" was played by a computer program implementing a secure multi-party computation (SMPC) between the f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edit Distance
In computational linguistics and computer science, edit distance is a string metric, i.e. a way of quantifying how dissimilar two strings (e.g., words) are to one another, that is measured by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing, where automatic spelling correction can determine candidate corrections for a misspelled word by selecting words from a dictionary that have a low distance to the word in question. In bioinformatics, it can be used to quantify the similarity of DNA sequences, which can be viewed as strings of the letters A, C, G and T. Different definitions of an edit distance use different sets of string operations. Levenshtein distance operations are the removal, insertion, or substitution of a character in the string. Being the most common metric, the term ''Levenshtein distance'' is often used interchangeably with ''edit distance''. Types of edit dis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Central Processing Unit
A central processing unit (CPU), also called a central processor, main processor or just processor, is the electronic circuitry that executes instructions comprising a computer program. The CPU performs basic arithmetic, logic, controlling, and input/output (I/O) operations specified by the instructions in the program. This contrasts with external components such as main memory and I/O circuitry, and specialized processors such as graphics processing units (GPUs). The form, design, and implementation of CPUs have changed over time, but their fundamental operation remains almost unchanged. Principal components of a CPU include the arithmetic–logic unit (ALU) that performs arithmetic and logic operations, processor registers that supply operands to the ALU and store the results of ALU operations, and a control unit that orchestrates the fetching (from memory), decoding and execution (of instructions) by directing the coordinated operations of the ALU, registers and other co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitcoin
Bitcoin ( abbreviation: BTC; sign: ₿) is a decentralized digital currency that can be transferred on the peer-to-peer bitcoin network. Bitcoin transactions are verified by network nodes through cryptography and recorded in a public distributed ledger called a blockchain. The cryptocurrency was invented in 2008 by an unknown person or group of people using the name Satoshi Nakamoto. The currency began use in 2009, when its implementation was released as open-source software. The word "''bitcoin''" was defined in a white paper published on October 31, 2008. It is a compound of the words ''bit'' and ''coin''. The legality of bitcoin varies by region. Nine countries have fully banned bitcoin use, while a further fifteen have implicitly banned it. A few governments have used bitcoin in some capacity. El Salvador has adopted Bitcoin as legal tender, although use by merchants remains low. Ukraine has accepted cryptocurrency donations to fund the resistance to the 2022 Russ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shamir's Secret Sharing
Shamir's Secret Sharing (SSS) is an efficient secret sharing algorithm for distributing private information (the "secret") in such a way that no individual holds intelligible information about the secret. To achieve this, the secret is converted into parts (the "shares") from which the secret can be reassembled when a sufficient number of shares are combined but not otherwise. SSS has the unusual property of information theoretic security, meaning an adversary without enough shares cannot reconstruct the secret even with infinite time and computing capacity. A standard SSS specification for cryptocurrency wallets has been widely implemented. High-level explanation SSS is used to secure a secret in a distributed way, most often to secure other encryption keys. The secret is split into multiple shares, which individually do not give any information about the secret. To unlock a secret secured by SSS a minimum number of shares are needed, called the ''threshold''. No additional in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Garbled Circuit
Garbled circuit is a cryptographic protocol that enables two-party secure computation in which two mistrusting parties can jointly evaluate a function over their private inputs without the presence of a trusted third party. In the garbled circuit protocol, the function has to be described as a Boolean circuit. The history of garbled circuits is complicated. The invention of garbled circuit was credited to Andrew Yao, as Yao introduced the idea in the oral presentation of a paper in FOCS'86. This was documented by Oded Goldreich in 2003. The first written document about this technique was by Goldreich, Micali, and Wigderson in STOC'87. The term "garbled circuit" was first used by Beaver, Micali, and Rogaway in STOC'90. Yao's protocol solving Yao's Millionaires' Problem was the beginning example of secure computation, yet it is not directly related to garbled circuits. Background Oblivious transfer In the garbled circuit protocol, we make use of oblivious transfer. In th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adversary Structure
An adversary is generally considered to be a person, group, or force that opposes and/or attacks. Adversary may also refer to: * Satan ("adversary" in Hebrew), in Judeo-Christian religion Entertainment Fiction * Adversary (comics), villain from the Marvel comics universe * The mysterious antagonist who invaded the homelands in the comic book series ''Fables'' Music * Ad·ver·sary, Canadian industrial musician Law * Adversarial system, a system of law commonly used in common-law countries * Adversary proceeding, proceeding used in bankruptcy processes Science * Adversarial collaboration, a scientific experiment Computer science * Adversary (cryptography), a malicious entity in cryptography whose aim is to prevent the users of the cryptosystem from achieving their goal * Adversary model, in online algorithms, used to show competitiveness of randomized algorithms Other * Adversarial purchasing, in business strategic management See also * The Adversary (other) * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Access Structure
Access structures are used in the study of security systems where multiple parties need to work together to obtain a resource. Groups of parties that are granted access are called qualified. In set theoretic terms they are referred to as qualified sets; in turn, the set of all such qualified sets is called the access structure of the system. Less formally it is a description of who needs to cooperate with whom in order to access the resource. In its original use in cryptography, the resource was a secret shared among the participants. Only subgroups of participants contained in the access structure are able to join their shares to recompute the secret. More generally, the resource can also be a task that a group of people can complete together, such as creating a digital signature, or decrypting an encrypted message. It is reasonable to assume that access structures are monotone in the sense that, if a subset S is in the access structure, all sets that contain S as a subset shou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Synchronization Networks
A synchronization network is a network of coupled dynamical systems. It consists of a network connecting oscillators, where oscillators are nodes that emit a signal with somewhat regular (possibly variable) frequency, and are also capable of receiving a signal. Particularly interesting is the phase transition where the entire network (or a very large percentage) of oscillators begins pulsing at the same frequency, known as synchronization. The synchronization network then becomes the substrate through which synchronization of these oscillators travels. Since there is no central authority organizing nodes, this is a form of self organizing system. Definition Generally, oscillators can be biological, electronic, or physical. Some examples are fireflies, crickets, heart cells, lasers, microwave oscillators, and neurons. Further example can be found in many domains. In a particular system, oscillators may be identical or non-identical. That is, either the network is mad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Verifiable Secret Sharing
In cryptography, a secret sharing scheme is verifiable if auxiliary information is included that allows players to verify their shares as consistent. More formally, verifiable secret sharing ensures that even if the dealer is malicious there is a well-defined secret that the players can later reconstruct. (In standard secret sharing, the dealer is assumed to be honest.) The concept of verifiable secret sharing (VSS) was first introduced in 1985 by Benny Chor, Shafi Goldwasser, Silvio Micali and Baruch Awerbuch. In a VSS protocol a distinguished player who wants to share the secret is referred to as the dealer. The protocol consists of two phases: a sharing phase and a reconstruction phase. Sharing: Initially the dealer holds secret as input and each player holds an independent random input. The sharing phase may consist of several rounds. At each round each player can privately send messages to other players and can also broadcast a message. Each message sent or broadcast by a pl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
