Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Scalable Multiparty Computation with Nearly Optimal Work and Resilience.

I. Damgård, Y. Ishai, M. Krøigaard, J. Nielsen, and A. Smith. CRYPTO, volume 5157 of Lecture Notes in Computer Science, page 241-261. Springer, (2008)

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.

Adam Gyula University of Stuttgart

Sabrina Adam University of Stuttgart

D. Marino

Dr. rer. nat. Ashley Smith University of Stuttgart

Galina Adam University of Stuttgart

Other publications of authors with the same name

Robust Traceability from Trace Amounts.C. Dwork, A. Smith, T. Steinke, J. Ullman, and S. Vadhan. FOCS, page 650-669. IEEE Computer Society, (2015)Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.Y. Dodis, B. Kanukurthi, J. Katz, L. Reyzin, and A. Smith. IEEE Trans. Information Theory, 58 (9): 6207-6222 (2012)Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. SIAM J. Comput., 38 (1): 97-139 (2008)Defending Against Attacks on Main Memory Persistence.W. Enck, K. Butler, T. Richardson, P. McDaniel, and A. Smith. ACSAC, page 65-74. IEEE Computer Society, (2008)Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism.S. Raskhodnikova, and A. Smith. FOCS, page 495-504. IEEE Computer Society, (2016)Max-Information, Differential Privacy, and Post-Selection Hypothesis Testing.R. Rogers, A. Roth, A. Smith, and O. Thakkar. CoRR, (2016)Codes for Computationally Simple Channels: Explicit Constructions with Optimal RateV. Guruswami, and A. Smith. CoRR, (2010)A Note on Adaptivity in Testing Properties of Bounded Degree Graphs.S. Raskhodnikova, and A. Smith. Electronic Colloquium on Computational Complexity (ECCC), (2006)From Soft Classifiers to Hard Decisions: How fair can we be?R. Canetti, A. Cohen, N. Dikkala, G. Ramnarayan, S. Scheffler, and A. Smith. CoRR, (2018)Private Graphon Estimation for Sparse Graphs.C. Borgs, J. Chayes, and A. Smith. CoRR, (2015)