Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
In cryptographic protocols it is often necessary to verify/certify the "tools" in use. This work demonstrates certain subtleties in treating a family of trapdoor permutations in this context, noting the necessity to "check" certain properties of these functions. The particular case we illustrate is that of noninteractive zero-knowledge. We point out that the elegant recent protocol of Feige, Lapidot, and Shamir for proving NP statements in noninteractive zero-knowledge requires an additional certification of the underlying trapdoor permutation, and suggest a method for certifying permutations which fills this gap. © 1996 International Association for Cryptologic Research.
Imran Nasim, Melanie Weber
SCML 2024
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009