Cramer, R.
, Damgård, I. B. & MacKenzie, P. (2000).
Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions. I H. Imai & Y. Zheng (red.),
Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings (s. 354-373). Springer.
https://doi.org/10.1007/978-3-540-46588-1_24
Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D.
& Simkin, M. (2018).
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Information Security,
12(3), 166-183.
https://doi.org/10.1049/iet-ifs.2017.0041
David, B., Dowsley, R., Katti, R. & Nascimento, A. C. A. (2015).
Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols. I M.-H. Au & A. Miyaji (red.),
Provable Security: 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings (Bind 9451, s. 354-367). Springer VS.
https://doi.org/10.1007/978-3-319-26059-4_20
Cascudo, I.
, Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019).
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). I S. D. Galbraith & S. Moriai (red.),
Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (s. 606-635). Springer.
https://doi.org/10.1007/978-3-030-34621-8_22
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P.
& Scholl, P. (2019).
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. I L. Cavallaro, J. Kinder, X. Wang & J. Katz (red.),
CCS 2019 - Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (s. 291-308). Association for Computing Machinery.
https://doi.org/10.1145/3319535.3354255
Agarwal, P.
, Arge, L., Erickson, J., Yu, H., Albers, S. (red.) & Radzik, T. (red.) (2004).
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. I
Ikke angivet (3221 i Lecture Notes in Computer Science udg., s. 4-15). Springer.
Agarwal, P. K.
, Arge, L. A., Erickson, J. & Yu, H. (2004).
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. I S. Albers & T. Radzik (red.),
Algorithms - ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings (s. 4-15). Springer.
https://doi.org/10.1007/978-3-540-30140-0_3
Arge, L. A., Chase, J. S., Vitter, J. S. & Wickremsinghe, R. (2000).
Efficient Sorting Using Registers and Caches. I S. Näher & D. Wagner (red.),
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (s. 51-62)
https://doi.org/10.1007/3-540-44691-5_5
Agarwal, P. K.
, Arge, L. A., Erickson, J., Franciosa, P. G. & Vitter, J. S. (2000).
Efficient Searching with Linear Constraints.
Journal of Computer and System Sciences,
61, Issue 2, 194-216.
https://doi.org/10.1006/jcss.2000.1709
Döttling, N. M. & Schröder, D. (2015).
Efficient Pseudorandom Functions via On-the-Fly Adaptation. I R. Gennaro & M. Robshaw (red.),
Advances in Cryptology – CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I (s. 329-350). Springer VS.
https://doi.org/10.1007/978-3-662-47989-6_16
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L.
& Scholl, P. (2019).
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. I D. Micciancio & A. Boldyreva (red.),
Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings: CRYPTO 2019 (s. 489-518). Springer.
https://doi.org/10.1007/978-3-030-26954-8_16
Baum, C., Escudero, D., Pedrouzo-Ulloa, A.
, Scholl, P. & Troncoso-Pastoriza, J. R. (2022).
Efficient protocols for oblivious linear function evaluation from ring-LWE.
Journal of Computer Security,
30(1), 39-78.
https://doi.org/10.3233/JCS-200116
Green, M.
, Hall-Andersen, M. N., Hennenfent, E., Kaptchuk, G., Perez, B. & Van Laer, G. (2023).
Efficient Proofs of Software Exploitability for Real-world Processors.
Proceedings on Privacy Enhancing Technologies,
2023(1), 627-640.
https://doi.org/10.56553/popets-2023-0036
Kremer, H., Günnemann, S., Ivanescu, A.-M.
, Assent, I. & Seidl, T. (2011).
Efficient Processing of Multiple DTW Queries in Time Series Databases.
Lecture Notes in Computer Science,
6809, 150-167.
https://doi.org/10.1007/978-3-642-22351-8_9
De Cock . M.
, Dowsley, R., Horst, C., Katti, R., Nascimento, A. C. A., Poon , W.-S. & Truex, S. (2017).
Efficient Privacy-Preserving Scoring of Decision Trees, SVM and Logistic Regression Models.
https://sites.google.com/view/psml/program
Faust, S., Mukherjee, P., Venturi, D. & Wichs, D. (2014).
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. I P. Q. Nguyen & E. Oswald (red.),
Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (s. 111-128 ). Springer.
https://doi.org/10.1007/978-3-642-55220-5_7
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013).
Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed.
Electronic Colloquium on Computational Complexity, (TR13-107).
http://eccc.hpi-web.de/report/2013/107/
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013).
Efficient multiparty protocols via log-depth threshold formulae. I R. Canetti & J. A. Garay (red.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (s. 185-202). Springer VS.
https://doi.org/10.1007/978-3-642-40084-1_11
Cramer, R.
, Damgård, I. B., Dziembowski, S., Hirt, M. & Rabin, T. (1999).
Efficient Multiparty Computations Secure Against an Adaptive Adversary. I J. Stern (red.),
Advances in Cryptology - EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings (s. 311-326). Springer.
https://doi.org/10.1007/3-540-48910-X_22
Genkin, D., Ishai , Y.
& Polychroniadou, A. (2015).
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. I R. Gennaro & M. Robshaw (red.),
Advances in Cryptology -- CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II (s. 721-741). Springer VS.
https://doi.org/10.1007/978-3-662-48000-7_35
Andrychowicz, M.
, Damgård, I. B., Dziembowski, S.
, Faust, S. & Polychroniadou, A. (2015).
Efficient leakage resilient circuit compilers. I K. Nyberg (red.),
Topics in Cryptology - CT-RSA 2015: The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings (s. 311-329). Springer VS.
https://doi.org/10.1007/978-3-319-16715-2_17
Abspoel, M., Cramer, R.
, Damgård, I. B., Escudero Ospina, D. E. & Yuan, C. (2019).
Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. I D. Hofheinz & A. Rosen (red.),
Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings: Proceedings (Bind Part 1, s. 471-501). Springer.
https://doi.org/10.1007/978-3-030-36030-6_19