Talk:Blinding (cryptography)

Cryptography: Computer science High‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
High	This article has been rated as High-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as High-importance).

Maybe this page should be merged with http://en.wikipedia.org/wiki/Commitment_scheme

Looked at Commitment_Scheme, this article seems to cover a different aspect. Blinding is used to protect the information being sent to one party to another for some sort of processing without revealing the original information to recepient. Commitment Schemes are essentially used to put information in secure 'escrow' which is eventually revealed to both parties at a later point. — Preceding unsigned comment added by 80.6.41.207 (talk) 10:50, 28 September 2011 (UTC)[reply]

Blinding issue[edit]

should r be not relatively coprime to N? — Preceding unsigned comment added by 130.75.243.97 (talk) 10:03, 20 August 2013 (UTC)[reply]

Differences from homomorphic encryption[edit]

I would find it useful if this article described how blinding differs from homomorphic encryption (cf. e.g. http://crypto.stackexchange.com/a/5837). Thoughtactivist (talk) 09:44, 3 December 2013 (UTC)[reply]

Me too! Comparing both articles, the focus seems to be slightly different: From the Wikipedia articles alone, I would guess:

homomorphic encryption focuses on finding a general solution for automatically constructing functions D and E such that D(f(E(x)))=f(x) for arbitrary functions f; or rather studying for which classes of functions this is theoretically possible.
blinding seems to be just a collective term for highly specific instances where one concrete D and E for a single concrete f were found.

However, this is just my impression from the Wikipedia articles. The different focus in the Wikipedia articles does not necessarily reflect the entirety of the terms blinding and homomorphic encryption as they are used outside Wikipedia. I'll start a discussion in the other article too. Maybe someone there has an answer. --217.240.200.253 (talk) 17:32, 7 April 2024 (UTC)[reply]