I was wondering what "securely realizes" means. I see this in some cryptographic papers but I don't know what it means for a protocol to "securely realize" a function $F$. Is it just a fancy way of saying "uses" or does it mean something else?
$\begingroup$
$\endgroup$
2
-
1$\begingroup$ Generally, if the author of the paper defines the meaning of that phrase or provides a footnote with a reference, the phrase is intended to have specific technical meaning, otherwise probably not. $\endgroup$– Henrick HellströmApr 24, 2013 at 22:59
-
$\begingroup$ If F is an instance of some standard notion (e.g., a hash function) associated with a standard security definition (e.g., collision resistance), then "securely realizing F" might mean that F satisfies some security notion (e.g., it is a hash function satisfying collision resistance). (I don't see how to "securely realize a function F," since the underlying standard notion isn't a function itself, but that might just be a wording issue in the original question.) $\endgroup$– user2768Aug 12, 2016 at 11:37
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
A standard approach in cryptography is to separate out the ideal specification (of what a scheme is supposed to achieve) from the particular instantiation (the implementation of the scheme).
To specify the security and functionality goals, sometimes cryptographers specify an "ideal functionality", which is an idealization of what we are hoping to achieve. Then, one designs a specific instantiation -- a particular scheme -- and proves that the scheme meets the goals set out in the "ideal functionality". We describe this by saying that the scheme securely realizes the ideal functionality. How to prove that is another can of worms entirely... but that's what is meant by the terminology.
This kind of approach and terminology is common in, for instance, theoretical work that adopts an "ideal world/real world" formalization (including, e.g., simulation-based security; indifferentiability; universal composability; and other lines of work in cryptography). See Wikipedia on universal composability for a high-level introduction.
