About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
FOCS 1999
Conference paper
Magic functions
Abstract
This study addresses three apparently unrelated problems: selective decommitment; 3-round weak zero-knowledge arguments; and the Fiat-Shamir methodology. By sketching these problems at high level, it is shown that these problems are closely related to circuit obfuscation or code obfuscation.