|
Socialist Millionaires
In cryptography, the socialist millionaire problem is one in which two millionaires want to determine if their wealth is equal without disclosing any information about their riches to each other. It is a variant of the Millionaire's Problem whereby two millionaires wish to compare their riches to determine who has the most wealth without disclosing any information about their riches to each other. It is often used as a cryptographic protocol that allows two parties to verify the identity of the remote party through the use of a shared secret, avoiding a man-in-the-middle attack without the inconvenience of manually comparing public key fingerprints through an outside channel. In effect, a relatively weak password/passphrase in natural language can be used. Motivation Alice and Bob have secret values x and y, respectively. Alice and Bob wish to learn if x = y without allowing either party to learn anything else about the other's secret value. A passive attacker simply spying on ... [...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] |
Order (group Theory)
In mathematics, the order of a finite group is the number of its elements. If a group is not finite, one says that its order is ''infinite''. The ''order'' of an element of a group (also called period length or period) is the order of the subgroup generated by the element. If the group operation is denoted as a multiplication, the order of an element of a group, is thus the smallest positive integer such that , where denotes the identity element of the group, and denotes the product of copies of . If no such exists, the order of is infinite. The order of a group is denoted by or , and the order of an element is denoted by or , instead of \operatorname(\langle a\rangle), where the brackets denote the generated group. Lagrange's theorem states that for any subgroup of a finite group , the order of the subgroup divides the order of the group; that is, is a divisor of . In particular, the order of any element is a divisor of . Example The symmetric group S3 has th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Logarithm
In mathematics, for given real numbers ''a'' and ''b'', the logarithm log''b'' ''a'' is a number ''x'' such that . Analogously, in any group ''G'', powers ''b''''k'' can be defined for all integers ''k'', and the discrete logarithm log''b'' ''a'' is an integer ''k'' such that . In number theory, the more commonly used term is index: we can write ''x'' = ind''r'' ''a'' (mod ''m'') (read "the index of ''a'' to the base ''r'' modulo ''m''") for ''r''''x'' ≡ ''a'' (mod ''m'') if ''r'' is a primitive root of ''m'' and gcd(''a'',''m'') = 1. Discrete logarithms are quickly computable in a few special cases. However, no efficient method is known for computing them in general. Several important algorithms in public-key cryptography, such as ElGamal base their security on the assumption that the discrete logarithm problem over carefully chosen groups has no efficient solution. Definition Let ''G'' be any group. Denote its group operation by mu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Man-in-the-middle
In cryptography and computer security, a man-in-the-middle, monster-in-the-middle, machine-in-the-middle, monkey-in-the-middle, meddler-in-the-middle, manipulator-in-the-middle (MITM), person-in-the-middle (PITM) or adversary-in-the-middle (AiTM) attack is a cyberattack where the attacker secretly relays and possibly alters the communications between two parties who believe that they are directly communicating with each other, as the attacker has inserted themselves between the two parties. One example of a MITM attack is active eavesdropping, in which the attacker makes independent connections with the victims and relays messages between them to make them believe they are talking directly to each other over a private connection, when in fact the entire conversation is controlled by the attacker. The attacker must be able to intercept all relevant messages passing between the two victims and inject new ones. This is straightforward in many circumstances; for example, an attacker wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
Multiplicative Group
In mathematics and group theory, the term multiplicative group refers to one of the following concepts: *the group under multiplication of the invertible elements of a field, ring, or other structure for which one of its operations is referred to as multiplication. In the case of a field ''F'', the group is , where 0 refers to the zero element of ''F'' and the binary operation • is the field multiplication, *the algebraic torus GL(1).. Examples *The multiplicative group of integers modulo ''n'' is the group under multiplication of the invertible elements of \mathbb/n\mathbb. When ''n'' is not prime, there are elements other than zero that are not invertible. * The multiplicative group of positive real numbers \mathbb^+ is an abelian group with 1 its identity element. The logarithm is a group isomorphism of this group to the additive group of real numbers, \mathbb. * The multiplicative group of a field F is the set of all nonzero elements: F^\times = F -\, under the multiplic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also ce ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Markus Jakobsson
Markus Jakobsson is a computer security researcher, entrepreneur and writer, whose work is focused on the issue of digital security. Career Markus Jakobsson is currently Chief Scientist at Artema Labs, a company with the mission of disrupting and improving the crypto and NFT markets. Prior to his current role, he has been Chief Scientist at ByteDance; Chief of Security and Data Analytics at Amber Solutions, and Chief Scientist at Agari. Prior to that, he was a senior director at Qualcomm as a result of Qualcomm acquiring FatSkunk in 2014; Jakobsson founded FatSkunk in 2009, and served as its CTO until the acquisition. Prior to his position at Qualcomm, Jakobsson has served as Principal Scientist of Consumer Security at PayPal, held positions as the Principal Scientist for Palo Alto Research Center and RSA Security, and served as vice president of the International Financial Cryptography Association. Prior to these positions, he was a member of the Technical Staff at Bell Labs, a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SMP - Socialist Millionaire Protocol
SMP may refer to: Organisations * Scale Model Products, 1950s, acquired by Aluminum Model Toys * School Mathematics Project, UK developer of mathematics textbooks * '' Sekolah Menengah Pertama'', "junior high school" in Indonesia * Shanghai Municipal Police, until 1943 * Sipah-e-Muhammad Pakistan, Pakistani group banned as terrorist * Post-nominal letters of Roman Catholic order Sisters of Mary of the Presentation * Standard Motor Products (NYSE: SMP), US automotive product company * ', the Finnish Rural Party, 1959-2003 Science and technology * Shape-memory polymer, smart materials * Signal Message Processor, for the Multifunctional Information Distribution System * Silyl modified polymers, used in adhesives and sealants * Simulation Model Portability, SMP2, European space mission simulator standard * Slow-moving proteinase, the enzyme Cathepsin E * Socialist millionaire problem in cryptography * Sorbitan monopalmitate, a food additive * SOTA Mapping Project, a website for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Off-the-Record Messaging
Off-the-Record Messaging (OTR) is a cryptographic protocol that provides encryption for instant messaging conversations. OTR uses a combination of AES symmetric-key algorithm with 128 bits key length, the Diffie–Hellman key exchange with 1536 bits group size, and the SHA-1 hash function. In addition to authentication and encryption, OTR provides forward secrecy and malleable encryption. The primary motivation behind the protocol was providing deniable authentication for the conversation participants while keeping conversations confidential, like a private conversation in real life, or off the record in journalism sourcing. This is in contrast with cryptography tools that produce output which can be later used as a verifiable record of the communication event and the identities of the participants. The initial introductory paper was named "Off-the-Record Communication, or, Why Not To Use PGP". The OTR protocol was designed by cryptographers Ian Goldberg and Nikita Borisov and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
