[108] Niklas Büscher, Daniel Demmler, Nikolaos P. Karvelas, Stefan Katzenbeisser, Juliane Krämer, Deevashwer Rathee, Thomas Schneider, and Patrick Struck. Secure two-party computation in a quantum world. In 18. International Conference on Applied Cryptography and Network Security (ACNS'20), LNCS, Springer, Rome, Italy, October 19-22, 2020. To appear. Full version: https://ia.cr/2020/411. CORE rank B. [ bib | pdf | web | Abstract ]
[107] Johannes Buchmann, Ghada Dessouky, Tommaso Frassetto, Ágnes Kiss, Ahmad-Reza Sadeghi, Thomas Schneider, Giulia Traverso, and Shaza Zeitouni. SAFE: A secure and efficient long-term distributed storage system. In 8. ACM International Workshop on Security in Blockchain and Cloud Computing (SBC'20), ACM, Taipei, Taiwan, October 6, 2020. To appear. Online: https://ia.cr/2020/690. [ bib | DOI | pdf | web | Abstract ]
[106] Marco Holz, Ágnes Kiss, Deevashwer Rathee, and Thomas Schneider. Linear-complexity private function evaluation is practical. In 25. European Symposium on Research in Computer Security (ESORICS'20), LNCS, Springer, Surrey, UK, September 14-18, 2020. To appear. Full version: https://ia.cr/2020/853. Code: https://encrypto.de/code/linearPFE. Acceptance rate 19.7%. CORE rank A. [ bib | pdf | web | Abstract ]
[105] Amos Treiber, Alejandro Molina, Christian Weinert, Thomas Schneider, and Kristian Kersting. CryptoSPN: Privacy-preserving sum-product network inference. In 24. European Conference on Artificial Intelligence (ECAI'20), IOS Press, Santiago de Compostela, Spain, Aug 29-Sep 5, 2020. To appear. Online: https://arxiv.org/abs/2002.00801. Acceptance rate 26.8%. CORE rank A. [ bib | pdf | web | Abstract ]
[104] Fabian Boemer, Rosario Cammarota, Daniel Demmler, Thomas Schneider, and Hossein Yalame. MP2ML: A mixed-protocol machine learning framework for private inference. In 15. International Conference on Availability, Reliability and Security (ARES'20), ACM, Virtual Event, Ireland, August 25-28, 2020. To appear. Full version: https://ia.cr/2020/721. Code: https://ngra.ph/he. Acceptance rate 21.3%. CORE rank B. [ bib | pdf | web | Abstract ]
[103] Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko, and Zheng Yang. Faster privacy-preserving location proximity schemes for circles and polygons. IET Information Security, 14(3):254–265, May, 2020. CORE rank C. [ bib | DOI | pdf | web | Abstract ]
[102] Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss, and Thomas Schneider. Efficient and scalable universal circuits. Journal of Cryptology (JoC), 33(3):1216–1271, April 8, 2020. Preliminary version: https://ia.cr/2019/348. Code: https://encrypto.de/code/UC. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[101] Sebastian P. Bayerl, Tommaso Frassetto, Patrick Jauernig, Korbinian Riedhammer, Ahmad-Reza Sadeghi, Thomas Schneider, Emmanuel Stapf, and Christian Weinert. Offline model guard: Secure and private ML on mobile devices. In 23. Design, Automation & Test in Europe Conference & Exhibition (DATE'20), pages 460–465, IEEE, Grenoble, France, March 9-13, 2020. Online: https://arxiv.org/abs/2007.02351. Acceptance rate 26%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[100] Thomas Schneider and Amos Treiber. A comment on privacy-preserving scalar product protocols as proposed in “SPOC”. IEEE Transactions on Parallel and Distributed Systems (TPDS), 31(3):543–546, March, 2020. Full version: https://arxiv.org/abs/1906.04862. Code: https://encrypto.de/code/SPOCattack. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[99] Amos Treiber, Andreas Nautsch, Jascha Kolberg, Thomas Schneider, and Christoph Busch. Privacy-preserving PLDA speaker verification using outsourced secure computation. Speech Communication, 114:60–71, November, 2019. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[98] Sebastian P. Bayerl, Ferdinand Brasser, Christoph Busch, Tommaso Frassetto, Patrick Jauernig, Jascha Kolberg, Andreas Nautsch, Korbinian Riedhammer, Ahmad-Reza Sadeghi, Thomas Schneider, Emmanuel Stapf, Amos Treiber, and Christian Weinert. Privacy-preserving speech processing via STPC and TEEs. 2. Privacy Preserving Machine Learning (PPML'19) – CCS 2019 Workshop, London, UK, November 15, 2019. Poster. Acceptance rate 55.0%. [ bib | pdf | poster | web | Abstract ]
[97] Daniel Günther, Ágnes Kiss, Lukas Scheidel, and Thomas Schneider. Framework for semi-private function evaluation with application to secure insurance rate calculation. In 26. ACM Conference on Computer and Communications Security (CCS'19) Poster/Demo, pages 2541–2543, ACM, London, UK, November 11-15, 2019. Acceptance rate 67.2%. CORE rank A*. [ bib | DOI | pdf | poster | web | Abstract ]
[96] Robert Nikolai Reith, Thomas Schneider, and Oleksandr Tkachenko. Efficiently stealing your machine learning models. In 18. Workshop on Privacy in the Electronic Society (WPES'19), pages 198–210, ACM, London, UK, November 11, 2019. Acceptance rate 20.9%. [ bib | DOI | pdf | web | Abstract ]
[95] Susanne Felsen, Ágnes Kiss, Thomas Schneider, and Christian Weinert. Secure and private function evaluation with Intel SGX. In 10. ACM Cloud Computing Security Workshop (CCSW'19), pages 165–181, ACM, London, UK, November 11, 2019. Acceptance rate 37.5%. [ bib | DOI | pdf | web | Abstract ]
[94] Andreas Nautsch, Abelino Jiménez, Amos Treiber, Jascha Kolberg, Catherine Jasserand, Els Kindt, Héctor Delgado, Massimiliano Todisco, Mohamed Amine Hmani, Aymen Mtibaa, Mohammed Ahmed Abdelraheem, Alberto Abad, Francisco Teixeira, Driss Matrouf, Marta Gomez-Barrero, Dijana Petrovska-Delacrétaz, Gérard Chollet, Nicholas Evans, Thomas Schneider, Jean-François Bonastre, Bhiksha Raj, Isabel Trancoso, and Christoph Busch. Preserving privacy in speaker and speech characterisation. Computer Speech and Language (CSL), 2019(58):441–480, November, 2019. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[93] Deevashwer Rathee, Thomas Schneider, and K. K. Shukla. Improved multiplication triple generation over rings via RLWE-based AHE. In 18. International Conference on Cryptology And Network Security (CANS'19), volume 11829 of LNCS, pages 347–359, Springer, Fuzhou, China, October 25-27, 2019. Short paper. Full version: https://ia.cr/2019/577. Acceptance rate 52.7%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[92] Andreas Nautsch, Jose Patino, Amos Treiber, Themos Stafylakis, Petr Mizera, Massimiliano Todisco, Thomas Schneider, and Nicholas Evans. Privacy-preserving speaker recognition with cohort score normalisation. In 20. Annual Conference of the International Speech Communication Association (INTERSPEECH'19), pages 2868–2872, International Speech Communication Association (ISCA), Graz, Austria, September 15-19, 2019. Online: https://arxiv.org/abs/1907.03454. Acceptance rate 49.3%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[91] Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, and Christian Weinert. Mobile private contact discovery at scale. In 28. USENIX Security Symposium (USENIX Security'19), pages 1447–1464, USENIX, Santa Clara, CA, USA, August 14-16, 2019. Website: https://contact-discovery.github.io. Full version: https://ia.cr/2019/517. Acceptance rate 16.2%. CORE rank A*. [ bib | pdf | web | Abstract ]
[90] Ágnes Kiss, Oliver Schick, and Thomas Schneider. Web application for privacy-preserving scheduling using secure computation. In 16. International Conference on Security and Cryptography (SECRYPT'19), pages 456–463, SciTePress, Prague, Czech Republic, July 26-28, 2019. Short paper. Code: https://encrypto.de/code/scheduling. Acceptance rate 15.2%. CORE rank B. [ bib | DOI | pdf | poster | web | Abstract ]
[89] Thomas Schneider and Oleksandr Tkachenko. EPISODE: Efficient Privacy-PreservIng Similar Sequence Queries on Outsourced Genomic DatabasEs. In 14. ACM Asia Conference on Information, Computer and Communications Security (ASIACCS'19), pages 315–327, ACM, Auckland, New Zealand, July 7-12, 2019. Acceptance rate 17.1%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[88] Kimmo Järvinen, Helena Leppäkoski, Elena Simona Lohan, Philipp Richter, Thomas Schneider, Oleksandr Tkachenko, and Zheng Yang. PILOT: Practical privacy-preserving Indoor Localization using OuTsourcing. In 4. IEEE European Symposium on Security and Privacy (EuroS&P'19), pages 448–463, IEEE, Stockholm, Sweden, June 17-19, 2019. Acceptance rate 20.0%. [ bib | DOI | pdf | web | Abstract ]
[87] Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, and Avishay Yanai. Efficient circuit-based PSI with linear communication. In 38. Advances in Cryptology – EUROCRYPT'19, volume 11478 of LNCS, pages 122–153, Springer, Darmstadt, Germany, May 19-23, 2019. Online: https://ia.cr/2019/241. Code: https://encrypto.de/code/OPPRF-PSI. Acceptance rate 23.2%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[86] Ágnes Kiss, Masoud Naderpour, Jian Liu, N. Asokan, and Thomas Schneider. SoK: Modular and efficient private decision tree evaluation. Proceedings on Privacy Enhancing Technologies (PoPETs), 2019(2):187–208, April 2019. Full version: https://ia.cr/2018/1099. Code: https://encrypto.de/code/PDTE. Acceptance rate 21.1%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[85] Niklas Büscher, Daniel Demmler, Stefan Katzenbeisser, David Kretzmer, and Thomas Schneider. HyCC: Compilation of hybrid protocols for practical secure computation. In 25. ACM Conference on Computer and Communications Security (CCS'18), pages 847–861, ACM, Toronto, Canada, October 15-19, 2018. Code: https://gitlab.com/securityengineering/HyCC. Acceptance rate 16.6%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[84] Oleksandr Tkachenko and Thomas Schneider. Towards efficient privacy-preserving similar sequence queries on outsourced genomic databases. In 17. Workshop on Privacy in the Electronic Society (WPES'18), pages 71–75, ACM, Toronto, Canada, October 15, 2018. Acceptance rate 36.5%. [ bib | DOI | pdf | web | Abstract ]
[83] Ágnes Kiss, Oliver Schick, and Thomas Schneider. Web application for privacy-preserving scheduling. 27. USENIX Security Symposium (USENIX Security'18) Poster Session, Baltimore, MD, USA, August 15-17, 2018. CORE rank A*. [ bib | poster | web ]
[82] Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko, and Zheng Yang. Faster privacy-preserving location proximity schemes. In 17. International Conference on Cryptology And Network Security (CANS'18), volume 11124 of LNCS, pages 3–22, Springer, Naples, Italy, September 30-October 3, 2018. Full version: https://ia.cr/2018/694. Acceptance rate 32.9%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[81] Ferdinand Brasser, Tommaso Frassetto, Korbinian Riedhammer, Ahmad-Reza Sadeghi, Thomas Schneider, and Christian Weinert. VoiceGuard: Secure and private speech processing. In 19. Annual Conference of the International Speech Communication Association (INTERSPEECH'18), pages 1303–1307, International Speech Communication Association (ISCA), Hyderabad, India, September 2-6, 2018. Acceptance rate 54%. CORE rank A. [ bib | DOI | pdf | poster | web | Abstract ]
[80] Philipp Richter, Zheng Yang, Oleksandr Tkachenko, Helena Leppäkoski, Kimmo Järvinen, Thomas Schneider, and Elena Simona Lohan. Received signal strength quantization for secure indoor positioning via fingerprinting. In 8. International Conference on Localization and GNSS (ICL-GNSS'18), pages 1–6, IEEE, Guimarães, Portugal, June 26-28, 2018. [ bib | DOI | pdf | web | Abstract ]
[79] Oleksandr Tkachenko, Christian Weinert, Thomas Schneider, and Kay Hamacher. Large-scale privacy-preserving statistical computations for distributed genome-wide association studies. In 13. ACM Asia Conference on Information, Computer and Communications Security (ASIACCS'18), pages 221–235, ACM, Songdo, South Korea, June 4-8, 2018. Acceptance rate 16.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[78] M. Sadegh Riazi, Christian Weinert, Oleksandr Tkachenko, Ebrahim M. Songhori, Thomas Schneider, and Farinaz Koushanfar. Chameleon: A hybrid secure computation framework for machine learning applications. In 13. ACM Asia Conference on Information, Computer and Communications Security (ASIACCS'18), pages 707–721, ACM, Songdo, South Korea, June 4-8, 2018. Preliminary version: https://ia.cr/2017/1164. Acceptance rate 16.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[77] Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. Efficient circuit-based PSI via cuckoo hashing. In 37. Advances in Cryptology – EUROCRYPT'18, volume 10822 of LNCS, pages 125–157, Springer, Tel Aviv, Israel, April 29-May 3, 2018. Full version: https://ia.cr/2018/120. Acceptance rate 23.0%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[76] Benny Pinkas, Thomas Schneider, and Michael Zohner. Scalable private set intersection based on OT extension. ACM Transactions on Privacy and Security (TOPS), 21(2):7:1–7:35, January 2018. Preliminary version: https://ia.cr/2016/930. Code: https://encrypto.de/code/JournalPSI. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[75] Marco Chiesa, Daniel Demmler, Marco Canini, Michael Schapira, and Thomas Schneider. SIXPACK: Securing Internet eXchange Points Against Curious onlooKers. In 13. International Conference on emerging Networking EXperiments and Technologies (CoNEXT'17), pages 120–133, ACM, Seoul, South Korea, December 12-15, 2017. Acceptance rate 18.1%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[74] Daniel Günther, Ágnes Kiss, and Thomas Schneider. More efficient universal circuit constructions. In 23. Advances in Cryptology – ASIACRYPT'17, volume 10625 of LNCS, pages 443–470, Springer, Hong Kong, China, December 3-7, 2017. Full version: https://ia.cr/2017/798. Code: https://encrypto.de/code/UC. Acceptance rate 27.6%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[73] Daniel Demmler, Kay Hamacher, Thomas Schneider, and Sebastian Stammler. Privacy-preserving whole-genome variant queries. In 16. International Conference on Cryptology And Network Security (CANS'17), volume 11261 of LNCS, pages 1–22, Springer, Hong Kong, China, November 30-December 2, 2017. Acceptance rate 31.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[72] Ágnes Kiss, Jian Liu, Thomas Schneider, N. Asokan, and Benny Pinkas. Private set intersection for unequal set sizes with mobile applications. Proceedings on Privacy Enhancing Technologies (PoPETs), 2017(4):177–197, October 2017. Full version: https://ia.cr/2017/670. Code: https://encrypto.de/code/MobilePSI. Acceptance rate 21.7%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[71] Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. More efficient oblivious transfer extensions. Journal of Cryptology (JoC), 30(3):805–858, July 2017. Updated version: https://ia.cr/2016/602. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[70] Daniel Demmler, Marco Holz, and Thomas Schneider. OnionPIR: Effective protection of sensitive metadata in online communication networks. In 15. International Conference on Applied Cryptography and Network Security (ACNS'17), volume 10355 of LNCS, pages 599–619, Springer, Kanazawa, Japan, July 10-12, 2017. Code: https://encrypto.de/code/onionPIR. Acceptance rate 22.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[69] Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner. Privacy-preserving interdomain routing at Internet scale. Proceedings on Privacy Enhancing Technologies (PoPETs), 2017(3):143–163, July 2017. Full version: https://ia.cr/2017/393. Acceptance rate 18.6%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[68] Jesper Buus Nielsen, Thomas Schneider, and Roberto Trifiletti. Constant round maliciously secure 2PC with function-independent preprocessing using LEGO. In 24. Annual Network and Distributed System Security Symposium (NDSS'17), Internet Society, San Diego, CA, USA, February 26-March 1, 2017. Acceptance rate 16.1%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[67] Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, Shaza Zeitouni, and Michael Zohner. Pushing the communication barrier in secure computation using lookup tables. In 24. Annual Network and Distributed System Security Symposium (NDSS'17), Internet Society, San Diego, CA, USA, February 26-March 1, 2017. Full version: https://ia.cr/2018/486. Acceptance rate 16.1%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[66] M. Sadegh Riazi, Ebrahim M. Songhori, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. Toward practical secure stable matching. Proceedings on Privacy Enhancing Technologies (PoPETs), 2017(1):62–78, January 2017. Acceptance rate 37.9%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[65] Marco Chiesa, Daniel Demmler, Marco Canini, Michael Schapira, and Thomas Schneider. Towards Securing Internet eXchange Points Against Curious onlooKers. In ACM, IRTF & ISOC Applied Networking Research Workshop (ANRW'16), pages 32–34, ACM, Berlin, Germany, July 16, 2016. Short paper. [ bib | DOI | pdf | web | Abstract ]
[64] Ebrahim M. Songhori, Shaza Zeitouni, Ghada Dessouky, Thomas Schneider, Ahmad-Reza Sadeghi, and Farinaz Koushanfar. GarbledCPU: A MIPS processor for secure computation in hardware. In 53. Annual Design Automation Conference (DAC'16), pages 73:1–73:6, ACM, Austin, TX, USA, June 5-9, 2016. Acceptance rate 17.4%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[63] Ágnes Kiss and Thomas Schneider. Valiant's universal circuit is practical. In 35. Advances in Cryptology – EUROCRYPT'16, volume 9665 of LNCS, pages 699–728, Springer, Vienna, Austria, May 8-12, 2016. Full version: https://ia.cr/2016/093. Code: https://encrypto.de/code/UC. Acceptance rate 22.6%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[62] Daniel Demmler, Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, and Shaza Zeitouni. Automated synthesis of optimized circuits for secure computation. In 22. ACM Conference on Computer and Communications Security (CCS'15), pages 1504–1517, ACM, Denver, CO, USA, October 12-16, 2015. Acceptance rate 19.8%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[61] Patrick Koeberl, Vinay Phegade, Anand Rajan, Thomas Schneider, Steffen Schulz, and Maria Zhdanova. Time to rethink: Trust brokerage using trusted execution environments. In 8. International Conference on Trust and Trustworthy Computing (TRUST'15), volume 9229 of LNCS, pages 181–190, Springer, Heraklion, Crete, Greece, August 24-26, 2015. Short paper. [ bib | DOI | pdf | web | Abstract ]
[60] Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. Phasing: Private set intersection using permutation-based hashing. In 24. USENIX Security Symposium (USENIX Security'15), pages 515–530, USENIX, Washington, DC, USA, August 12-14, 2015. Full version: https://ia.cr/2015/634. Code: https://encrypto.de/code/PSI. Acceptance rate 15.7%. CORE rank A*. [ bib | pdf | web | Abstract ]
[59] Ebrahim M. Songhori, Siam U. Hussain, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. TinyGarble: Highly compressed and scalable sequential garbled circuits. In 36. IEEE Symposium on Security and Privacy (IEEE S&P'15), pages 411–428, IEEE, San Jose, CA, USA, May 18-20, 2015. Acceptance rate 13.5%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[58] Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. More efficient oblivious transfer extensions with security for malicious adversaries. In 34. Advances in Cryptology – EUROCRYPT'15, volume 9056 of LNCS, pages 673–701, Springer, Sofia, Bulgaria, April 26-30, 2015. Full version: https://ia.cr/2015/061. Code: https://encrypto.de/code/OTExtension. Acceptance rate 29.4%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[57] Martin Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. Ciphers for MPC and FHE. In 34. Advances in Cryptology – EUROCRYPT'15, volume 9056 of LNCS, pages 430–454, Springer, Sofia, Bulgaria, April 26-30, 2015. Full version: https://ia.cr/2016/687. Acceptance rate 29.4%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[56] Daniel Demmler, Thomas Schneider, and Michael Zohner. ABY – a framework for efficient mixed-protocol secure two-party computation. In 22. Annual Network and Distributed System Security Symposium (NDSS'15), Internet Society, San Diego, CA, USA, February 8-11, 2015. Code: https://encrypto.de/code/ABY. Acceptance rate 18.4%. CORE rank A*. [ bib | pdf | web | Abstract ]
[55] Daniel Demmler, Amir Herzberg, and Thomas Schneider. RAID-PIR: Practical multi-server PIR. In 6. ACM Cloud Computing Security Workshop (CCSW'14), pages 45–56, ACM, Scottsdale, AZ, USA, November 7, 2014. Code: https://encrypto.de/code/RAID-PIR. Acceptance rate 33.3%. [ bib | DOI | pdf | web | Abstract ]
[54] Daniel Demmler, Thomas Schneider, and Michael Zohner. Ad-hoc secure two-party computation on mobile devices using hardware tokens. In 23. USENIX Security Symposium (USENIX Security'14), pages 893–908, USENIX, San Diego, CA, USA, August 20-22, 2014. Full version: https://ia.cr/2014/467. Acceptance rate 19.1%. CORE rank A*. [ bib | pdf | web | Abstract ]
[53] Benny Pinkas, Thomas Schneider, and Michael Zohner. Faster private set intersection based on OT extension. In 23. USENIX Security Symposium (USENIX Security'14), pages 797–812, USENIX, San Diego, CA, USA, August 20-22, 2014. Full version: https://ia.cr/2014/447. Code: https://encrypto.de/code/PSI. Acceptance rate 19.1%. CORE rank A*. [ bib | pdf | web | Abstract ]
[52] Julien Bringer, Hervé Chabanne, Mélanie Favre, Alain Patey, Thomas Schneider, and Michael Zohner. GSHADE: Faster privacy-preserving distance computation and biometric identification. In 2. ACM Workshop on Information Hiding and Multimedia Security (IH&MMSEC'14), pages 187–198, ACM, Salzburg, Austria, June 11-13, 2014. Code: https://encrypto.de/code/GSHADE. Acceptance rate 37.5%. CORE rank C. [ bib | DOI | pdf | web | Abstract ]
[51] Matthias Schneider and Thomas Schneider. Notes on non-interactive secure comparison in “image feature extraction in the encrypted domain with privacy-preserving SIFT”. In 2. ACM Workshop on Information Hiding and Multimedia Security (IH&MMSEC'14), pages 432–440, ACM, Salzburg, Austria, June 11-13, 2014. Acceptance rate 37.5%. CORE rank C. [ bib | DOI | pdf | web | Abstract ]
[50] Florian Kerschbaum, Thomas Schneider, and Axel Schröpfer. Automatic protocol selection in secure two-party computations. In 12. International Conference on Applied Cryptography and Network Security (ACNS'14), volume 8479 of LNCS, pages 566–584, Springer, Lausanne, Switzerland, June 10-13, 2014. Full version: https://ia.cr/2014/200. Acceptance rate 22.4%. CORE rank B. [ bib | DOI | pdf | Abstract ]
[49] Daniel Demmler, Thomas Schneider, and Michael Zohner. Hardware-assisted ad-hoc secure two-party computation on smartphones. In 19. Workshop der Fachgruppe Kryptographie in der Gesellschaft für Informatik (Kryptotag), Stuttgart, Germany, November 14-15, 2013. [ bib | pdf ]
[48] Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. More efficient oblivious transfer and extensions for faster secure computation. In 20. ACM Conference on Computer and Communications Security (CCS'13), pages 535–548, ACM, Berlin, Germany, November 4-8, 2013. Full version: https://ia.cr/2013/552. Code: https://encrypto.de/code/OTExtension. Acceptance rate 19.8%. CORE rank A*. [ bib | DOI | pdf | Abstract ]
[47] N. Asokan, Alexandra Dmitrienko, Marcin Nagy, Elena Reshetova, Ahmad-Reza Sadeghi, Thomas Schneider, and Stanislaus Stelle. CrowdShare: Secure mobile resource sharing. In 11. International Conference on Applied Cryptography and Network Security (ACNS'13), volume 7954 of LNCS, pages 432–440, Springer, Banff, Alberta, Canada, June 25-28, 2013. Short paper. Full version: https://encrypto.de/papers/ADNRSSS13_TR.pdf. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[46] Vladimir Kolesnikov and Thomas Schneider. Secure function evaluation techniques for circuits containing XOR gates with applications to universal circuits. U.S. patent no 8443205 (applied October 24, 2008; issued May 14, 2013), May 14, 2013. [ bib | pub | Abstract ]
[45] Wilko Henecka and Thomas Schneider. Faster secure two-party computation with less memory. In 8. ACM Symposium on Information, Computer and Communications Security (ASIACCS'13), pages 437–446, ACM, Hangzhou, China, May 7-10, 2013. Code: https://encrypto.de/code/me-sfe. Acceptance rate 16.2% for full papers. CORE rank B. [ bib | DOI | pdf | Abstract ]
[44] Thomas Schneider and Michael Zohner. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In 17. International Conference on Financial Cryptography and Data Security (FC'13), volume 7859 of LNCS, pages 275–292, Springer, Okinawa, Japan, April 1-5, 2013. Acceptance rate 12.5% for regular papers. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[43] Florian Kerschbaum, Thomas Schneider, and Axel Schröpfer. Automatic protocol selection in secure two-party computations. 20. Network and Distributed System Security Symposium (NDSS'13) Short Talk, San Diego, CA, USA, February 24-27, 2013. CORE rank A*. [ bib | pdf | web ]
[42] Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design. Journal of Computer Security (JCS), 21(2):283–315, January 2013. Preliminary version: https://ia.cr/2010/079. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[41] Thomas Schneider and Michael Zohner. Efficient secure two-party computation. In 17. Workshop der Fachgruppe Kryptographie in der Gesellschaft für Informatik (Kryptotag), Heidelberg, Germany, December 7, 2012. [ bib | pdf ]
[40] Pille Pullonen, Dan Bogdanov, and Thomas Schneider. The design and implementation of a two-party protocol suite for SHAREMIND 3. Technical report, CYBERNETICA Institute of Information Security, 2012. T-4-17. [ bib | pdf ]
[39] Thomas Schneider. Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation. Springer-Verlag Berlin Heidelberg, August 4, 2012. https://thomaschneider.de/engineeringSFEbook. [ bib | DOI | pub ]
[38] Vladimir Kolesnikov and Thomas Schneider. Universal circuit for secure function evaluation. U.S. patent no 8175854 (applied July 14, 2008; issued May 8, 2012), May 8, 2012. [ bib | pub | Abstract ]
[37] Junaid Jameel Ahmad, Shujun Li, Ahmad-Reza Sadeghi, and Thomas Schneider. CTL: A platform-independent crypto tools library based on dataflow programming paradigm. In 16. International Conference on Financial Cryptography and Data Security (FC'12), volume 7397 of LNCS, pages 299–313, Springer, Bonaire, February 27 - March 2, 2012. Full version: https://ia.cr/2011/679. Acceptance rate 26.1%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[36] Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sadeghi, and Thomas Schneider. Twin Clouds: Secure cloud computing with low latency. In 12. Communications and Multimedia Security Conference (CMS'11), volume 7025 of LNCS, pages 32–44, Springer, October 19-21, 2011. Best Paper Award. Acceptance rate 21.2%. CORE rank C. [ bib | DOI | pdf | Abstract ]
[35] Sven Bugiel, Stefan Nürnberger, Thomas Pöppelmann, Ahmad-Reza Sadeghi, and Thomas Schneider. AmazonIA: When elasticity snaps back. In 18. ACM Conference on Computer and Communications Security (CCS'11), pages 389–400, ACM, Chicago, IL, USA, October 17-21, 2011. Acceptance rate 14.0%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[34] Mauro Barni, Pierluigi Failla, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, and Thomas Schneider. Privacy-preserving ECG classification with branching programs and neural networks. IEEE Transactions on Information Forensics and Security (TIFS), 6(2):452–468, June 2011. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[33] Thomas Schneider. Reden ist Silber - Schweigen ist Gold: Datensparsamkeit durch effizientes Rechnen unter Verschlüsselung. In 12. Deutscher IT-Sicherheitskongress des BSI: Sicher in die digitale Welt von morgen, pages 191–198, SecuMedia-Verlag, Bonn, Germany, May 10-12, 2011. [ bib | pdf | pub | Abstract ]
[32] Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sadeghi, and Thomas Schneider. Twin Clouds: An architecture for secure cloud computing (Extended Abstract). Workshop on Cryptography and Security in Clouds (WCSC'11), Zurich, Switzerland, March 15-16, 2011. [ bib | pdf | web | Abstract ]
[31] Marc Fischlin, Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, and Ivan Visconti. Secure set intersection with untrusted hardware tokens. In 11. Cryptographers' Track at the RSA Conference (CT-RSA'11), volume 6558 of LNCS, pages 1–16, Springer, San Francisco, CA, USA, February 14-18, 2011. Acceptance rate 29.9%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[30] Thomas Schneider. Engineering Secure Two-Party Computation Protocols – Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation. PhD thesis, Ruhr-University Bochum, Germany, February 9, 2011. [ bib | pdf | Abstract ]
[29] Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Efficient secure two-party computation with untrusted hardware tokens. In Ahmad-Reza Sadeghi and David Naccache, editors, Towards Hardware Intrinsic Security: Foundation and Practice, Information Security and Cryptography, pages 367–386. Springer-Verlag Berlin Heidelberg, 2010. [ bib | DOI ]
[28] Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. TASTY: Tool for Automating Secure Two-partY computations. In 17. ACM Conference on Computer and Communications Security (CCS'10), pages 451–462, ACM, Chicago, IL, USA, October 4-8, 2010. Full version: https://ia.cr/2010/365. Code: https://encrypto.de/code/TASTY. Acceptance rate 17.2%. CORE rank A*. [ bib | DOI | pdf | web | Abstract ]
[27] José Bacelar Almeida, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad-Reza Sadeghi, and Thomas Schneider. A certifying compiler for zero-knowledge proofs of knowledge based on sigma-protocols. In 15. European Symposium on Research in Computer Security (ESORICS'10), volume 6345 of LNCS, pages 151–167, Springer, Athens, Greece, September 20-22, 2010. Full version: https://ia.cr/2010/339. Acceptance rate 20.9%. CORE rank A. [ bib | DOI | pdf | Abstract ]
[26] Ahmad-Reza Sadeghi and Thomas Schneider. Verschlüsselt Rechnen: Sichere Verarbeitung verschlüsselter medizinischer Daten am Beispiel der Klassifikation von EKG-Daten. In Workshop Innovative und sichere Informationstechnologie für das Gesundheitswesen von morgen (perspeGKtive'10), volume P-174 of LNI, pages 11–25, Bonner Köllen Verlag, Darmstadt, Germany, September 8, 2010. [ bib | pdf | pub | Abstract ]
[25] Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs. In 12. International Workshop on Cryptographic Hardware and Embedded Systems (CHES'10), volume 6225 of LNCS, pages 383–397, Springer, Santa Barbara, CA, USA, August 17-20, 2010. Full version: https://ia.cr/2010/276. Acceptance rate 27.8%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[24] Endre Bangerter, Stephan Krenn, Ahmad-Reza Sadeghi, and Thomas Schneider. YACZK: Yet another compiler for zero-knowledge. 19. USENIX Security Symposium (USENIX Security'10) Poster Session, Washington, DC, USA, August 11-13, 2010. CORE rank A*. [ bib | pdf | poster | web | Abstract ]
[23] Ahmad-Reza Sadeghi, Thomas Schneider, and Marcel Winandy. Token-based cloud computing – secure outsourcing of data and arbitrary computations with lower latency. In 3. International Conference on Trust and Trustworthy Computing (TRUST'10) - Workshop on Trust in the Cloud, volume 6101 of LNCS, pages 417–429, Springer, Berlin, Germany, June 21-23, 2010. [ bib | DOI | pdf | web | Abstract ]
[22] Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Embedded SFE: Offloading server and network using hardware tokens. In 14. International Conference on Financial Cryptography and Data Security (FC'10), volume 6052 of LNCS, pages 207–221, Springer, Tenerife, Canary Islands, Spain, January 25-28, 2010. Full version: https://ia.cr/2009/591. Acceptance rate 14.6%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[21] Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In 8. International Conference on Cryptology And Network Security (CANS'09), volume 5888 of LNCS, pages 1–20, Springer, Kanazawa, Japan, December 12-14, 2009. Full version: https://ia.cr/2009/411. Acceptance rate 29.4%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[20] Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams. Secure two-party computation is practical. In 15. Advances in Cryptology – ASIACRYPT'09, volume 5912 of LNCS, pages 250–267, Springer, Tokyo, Japan, December 6-10, 2009. Full version: https://ia.cr/2009/314. Acceptance rate 13.7%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[19] Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, Annika Paus, Ahmad-Reza Sadeghi, and Thomas Schneider. Efficient privacy-preserving classification of ECG signals. In 1. IEEE International Workshop on Information Forensics and Security (IEEE WIFS'09), pages 91–95, IEEE, London, UK, December 6-9, 2009. Acceptance rate 32.5%. [ bib | DOI | pdf | Abstract ]
[18] Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. Efficient privacy-preserving face recognition. In 12. International Conference on Information Security and Cryptology (ICISC'09), volume 5984 of LNCS, pages 229–244, Springer, Seoul, South Korea, December 2-4, 2009. Full version: https://ia.cr/2009/507. Acceptance rate 19.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[17] Ahmad-Reza Sadeghi and Thomas Schneider. Ask your e-doctor without telling: Privacy-preserving medical diagnostics. Section Days of Ruhr-University Bochum Research School, Bochum, Germany, November 6, 2009. (Poster prize awarded). [ bib | poster | web ]
[16] Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In ECRYPT workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC'09), Berlin, Germany, October 12-13, 2009. [ bib | pdf | web | Abstract ]
[15] Endre Bangerter, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider, and Joe-Kai Tsay. On the design and implementation of efficient zero-knowledge proofs of knowledge. In ECRYPT workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC'09), Berlin, Germany, October 12-13, 2009. [ bib | pdf | web | Abstract ]
[14] Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, and Thomas Schneider. Secure evaluation of private linear branching programs with medical applications. In 14. European Symposium on Research in Computer Security (ESORICS'09), volume 5789 of LNCS, pages 424–439, Springer, Saint Malo, France, September 21-25, 2009. Full version: https://ia.cr/2009/195. Acceptance rate 19.1%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[13] Endre Bangerter, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad-Reza Sadeghi, and Thomas Schneider. Automatic generation of sigma-protocols. In 6. European Workshop on Public Key Services, Applications and Infrastructures (EUROPKI'09), volume 6391 of LNCS, pages 67–82, Springer, Pisa, Italy, September 10-11, 2009. Acceptance rate 45.0%. CORE rank B. [ bib | DOI | pdf | Abstract ]
[12] Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, and Thomas Schneider. Combining signal processing and cryptographic protocol design for efficient ECG classification. In 1. International Workshop on Signal Processing in the EncryptEd Domain (SPEED'09), Lausanne, Switzerland, September 10, 2009. [ bib | pdf | Abstract ]
[11] Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. How to combine homomorphic encryption and garbled circuits - improved circuits and computing the minimum distance efficiently. In 1. International Workshop on Signal Processing in the EncryptEd Domain (SPEED'09), Lausanne, Switzerland, September 10, 2009. [ bib | pdf | Abstract ]
[10] Annika Paus, Ahmad-Reza Sadeghi, and Thomas Schneider. Practical secure evaluation of semi-private functions. In 7. International Conference on Applied Cryptography and Network Security (ACNS'09), volume 5536 of LNCS, pages 89–106, Springer, Paris-Rocquencourt, France, June 2-5, 2009. Full version: https://ia.cr/2009/124. Code: https://encrypto.de/code/FairplaySPF. Acceptance rate 21.3%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[9] Endre Bangerter, Jan Camenisch, Stephan Krenn, Ahmad-Reza Sadeghi, and Thomas Schneider. Automatic generation of sound zero-knowledge protocols. 28. Advances in Cryptology – EUROCRYPT'09 Poster Session, Cologne, Germany, April 26-30, 2009. Full version: https://ia.cr/2008/471. Acceptance rate 33% for papers and posters. CORE rank A*. [ bib | pdf | poster | web | Abstract ]
[8] Endre Bangerter, Stefania Barzan, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider, and Joe-Kai Tsay. Bringing zero-knowledge proofs of knowledge to practice. In 17. International Workshop on Security Protocols (SPW'09), volume 7028 of LNCS, pages 51–62, Springer, Cambridge, UK, April 1-3, 2009. Full version: https://ia.cr/2009/211. [ bib | DOI | pdf | Abstract ]
[7] Ahmad-Reza Sadeghi and Thomas Schneider. Generalized universal circuits for secure evaluation of private functions with application to data classification. In 11. International Conference on Information Security and Cryptology (ICISC'08), volume 5461 of LNCS, pages 336–353, Springer, Seoul, South Korea, December 3-5, 2008. Full version: https://ia.cr/2008/453. Acceptance rate 19.8%. CORE rank B. [ bib | DOI | pdf | web | Abstract ]
[6] Vladimir Kolesnikov and Thomas Schneider. Improved garbled circuit: Free XOR gates and applications. In 35. International Colloquium on Automata, Languages and Programming (ICALP'08), volume 5126 of LNCS, pages 486–498, Springer, Reykjavik, Iceland, July 6-13, 2008. Acceptance rate 30%. CORE rank A. [ bib | DOI | pdf | web | Abstract ]
[5] Vladimir Kolesnikov, Thomas Schneider, and Volker Strehl. Practical secure function evaluation. In 8. Workshop der Fachgruppe Kryptographie in der Gesellschaft für Informatik (Kryptotag), volume WSI-2008-02, Tübingen, Germany, April 11, 2008. [ bib | pdf ]
[4] Thomas Schneider. Practical secure function evaluation. In Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2008), volume S-6 of LNI, pages 37–40, GI, Bonn, Germany, March 14, 2008. [ bib | pdf | poster | pub ]
[3] Thomas Schneider. Practical secure function evaluation. Master's thesis, Friedrich-Alexander University Erlangen-Nürnberg, Germany, February 27, 2008. [ bib | pdf | Abstract ]
[2] Vladimir Kolesnikov and Thomas Schneider. A practical universal circuit construction and secure evaluation of private functions. In 12. International Conference on Financial Cryptography and Data Security (FC'08), volume 5143 of LNCS, pages 83–97, Springer, Cozumel, Mexico, January 28-31, 2008. Code: https://encrypto.de/code/FairplayPF. Acceptance rate 19.1%. CORE rank B. [ bib | DOI | pdf | pub | web | Abstract ]
[1] Thomas Schneider. Secure task migration and interprocess communication in reconfigurable, distributed, embedded systems. Bachelor's thesis, Friedrich-Alexander University Erlangen-Nürnberg, Germany, July 10, 2007. [ bib | pdf ]