In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in order to gain some kind of inappropriate advantage. They are important to a variety of cryptographic protocols including secure coin flipping, zero-knowledge proofs, and secure computation.

PropertyValue
dbpprop:abstract
  • In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in order to gain some kind of inappropriate advantage. They are important to a variety of cryptographic protocols including secure coin flipping, zero-knowledge proofs, and secure computation. Interactions in a commitment scheme take place in two phases: the commit phase during which a value is chosen and specified the reveal phase during which the value is revealed and checked In simple protocols, the commit phase consists of a single message from the sender to the receiver. This message is called the commitment. It is essential that the specific value chosen cannot be known by the receiver at that time (this is called the hiding property). A simple reveal phase would consist of a single message, the opening, from the sender to the receiver, followed by a check performed by the receiver. The value chosen during the commit phase must be the only one that the sender can compute and that validates during the reveal phase (this is called the binding property). The concept of commitment schemes was first formalized by Gilles Brassard, David Chaum, and Claude Crepeau in 1988, but the concept was used without being treated formally prior to that. The notion of commitments appeared earliest in works by Manuel Blum, Shimon Even, and Shamir et al. The terminology seems to have been originated by Blum, although commitment schemes can be interchangeably called bit commitment schemes—sometimes reserved for the special case where the committed value is a binary bit.
  • En cryptologie, la mise en gage est une méthode par laquelle un premier parti, souvent appelé Alice, "met en gage" un bit d'information envers un deuxième parti, souvent appelé Bob. Ceci se fait sans que la valeur du bit soit révélée et de telle sorte que la mise en gage peut être révélée, ou "ouverte", plus tard par Alice et vérifiée par Bob.
  • В криптографии, схема обязательств или битовая схема обязательств — это метод, позволяющий пользователю подтверждать какое-либо значение, которое не разглашается, то есть в случае разглашения этого значения благодаря этой схеме будет известно, что пользователь знал его на момент выдачи обязательства и что оно не изменилось. Работу данной схему можно представить как посылку закрытой на ключ коробки (обязательство), ключ от которой (значение) может выслаться позже.
dbpprop:hasPhotoCollection
dbpprop:reference
rdf:type
rdfs:comment
  • In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in order to gain some kind of inappropriate advantage. They are important to a variety of cryptographic protocols including secure coin flipping, zero-knowledge proofs, and secure computation.
  • En cryptologie, la mise en gage est une méthode par laquelle un premier parti, souvent appelé Alice, "met en gage" un bit d'information envers un deuxième parti, souvent appelé Bob. Ceci se fait sans que la valeur du bit soit révélée et de telle sorte que la mise en gage peut être révélée, ou "ouverte", plus tard par Alice et vérifiée par Bob.
rdfs:label
  • Commitment scheme
  • Mise en gage
  • Схема обязательства
owl:sameAs
skos:subject
foaf:page
is dbpprop:disambiguates of
is dbpprop:redirect of
is owl:sameAs of