Author of the publication

Efficient Cryptographic Schemes Provably as Secure as Subset Sum.

, and . J. Cryptol., 9 (4): 199-216 (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery., , and . ITC, volume 163 of LIPIcs, page 9:1-9:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Untraceable Electronic Cash., , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 319-327. Springer, (1988)Computationally Secure Oblivious Transfer., and . J. Cryptol., 18 (1): 1-35 (2005)Traitor tracing with constant size ciphertext., and . ACM Conference on Computer and Communications Security, page 501-510. ACM, (2008)How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior., , and . ACM Conference on Computer and Communications Security, page 1369-1386. ACM, (2019)On fairness in the carpool problem.. J. Algorithms, 55 (1): 93-98 (2005)Small-Bias Probability Spaces: Efficient Constructions and Applications., and . SIAM J. Comput., 22 (4): 838-856 (1993)Implicit O(1) Probe Search., and . SIAM J. Comput., 22 (1): 1-10 (1993)Tracing Traitors, , , and . (1994)Tight Bounds for Sliding Bloom Filters., and . Algorithmica, 73 (4): 652-672 (2015)