Eligma

Eligma, in computer science and cryptography, refers to a commitment scheme where the committer provides a computationally binding but statistically hiding commitment to a value. This means that the committer cannot change their mind about the committed value (computational binding), and the receiver cannot learn anything about the committed value from the commitment alone (statistical hiding).

Eligma schemes are often used as a building block in more complex cryptographic protocols, such as zero-knowledge proofs and secure multi-party computation. The properties of computational binding and statistical hiding are crucial for ensuring the security of these protocols.

The term "Eligma" is not as widely used as other commitment schemes and may be referred to using alternative terminology depending on the specific implementation and context. The specific implementation details of an Eligma scheme will depend on the underlying cryptographic assumptions and primitives used. A typical implementation may involve hashing and encryption.