Author image not provided
 Thomas Schneider

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article16.97
Citation Count628
Publication count37
Publication years2008-2017
Available for download11
Average downloads per article358.55
Downloads (cumulative)3,944
Downloads (12 Months)544
Downloads (6 Weeks)99
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


38 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 38
Result page: 1 2

Sort by:

1 published by ACM
January 2018 ACM Transactions on Privacy and Security (TOPS): Volume 21 Issue 2, January 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 17,   Downloads (12 Months): 17,   Downloads (Overall): 17

Full text available: PDFPDF
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection. It is one of the best studied applications of secure computation and many PSI protocols have been proposed. However, the variety of existing PSI ...
Keywords: Privacy-preserving protocols, Anonymity and untraceability, Pseudonymity

2 published by ACM
November 2017 CoNEXT '17: Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 37,   Downloads (12 Months): 60,   Downloads (Overall): 60

Full text available: PDFPDF
Internet eXchange Points (IXPs) play an ever-growing role in Internet inter-connection. To facilitate the exchange of routes amongst their members, IXPs provide Route Server (RS) services to dispatch the routes according to each member's peering policies. Nowadays, to make use of RSes, these policies must be disclosed to the IXP. ...
Keywords: Secure Multi Party Computation, Internet eXchange Points, interdomain routing, privacy-preserving routing

3
July 2017 Journal of Cryptology: Volume 30 Issue 3, July 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes more practical, the need for practical large-scale OT protocols is becoming more evident. OT extensions are protocols that enable a relatively small ...
Keywords: Oblivious transfer extension, Implementation, Cryptographic protocols

4 published by ACM
July 2016 ANRW '16: Proceedings of the 2016 Applied Networking Research Workshop
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 33,   Downloads (Overall): 33

Full text available: PDFPDF
The growing relevance of Internet eXchange Points (IXPs), where an increasing number of networks exchange routing information, poses fundamental questions regarding the privacy guarantees of confidential business information. To facilitate the exchange of routes among their members, IXPs provide Route Server (RS) services to dispatch the routes according to each ...
Keywords: internet exchange points, privacy, routing, secure multiparty

5 published by ACM
June 2016 DAC '16: Proceedings of the 53rd Annual Design Automation Conference
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 4,   Downloads (12 Months): 49,   Downloads (Overall): 103

Full text available: PDFPDF
We present GarbledCPU, the first framework that realizes a hardware-based general purpose sequential processor for secure computation. Our MIPS-based implementation enables development of applications (functions) in a high-level language while performing secure function evaluation (SFE) using Yao's garbled circuit protocol in hardware. GarbledCPU provides three degrees of freedom for SFE ...
Keywords: garbled circuit, secure function evaluation

6
May 2016 Proceedings, Part I, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9665
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Universal circuits UCs can be programmed to evaluate any circuit of a given size k. They provide elegant solutions in various application scenarios, e.g. for private function evaluation﾿PFE and for improving the flexibility of attribute-based encryption﾿ABE schemes. The optimal size of a universal circuit is proven to be $$\varOmega k\log ...
Keywords: Universal circuit, Private function evaluation, Size-optimization

7
May 2016 Proceedings of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9665
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Universal circuits UCs can be programmed to evaluate any circuit of a given size k. They provide elegant solutions in various application scenarios, e.g. for private function evaluation﾿PFE and for improving the flexibility of attribute-based encryption﾿ABE schemes. The optimal size of a universal circuit is proven to be $$\varOmega k\log ...
Keywords: Size-optimization, Universal circuit, Private function evaluation

8 published by ACM
October 2015 CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 7,   Downloads (12 Months): 53,   Downloads (Overall): 282

Full text available: PDFPDF
In the recent years, secure computation has been the subject of intensive research, emerging from theory to practice. In order to make secure computation usable by non-experts, Fairplay (USENIX Security 2004) initiated a line of research in compilers that allow to automatically generate circuits from high-level descriptions of the functionality ...
Keywords: secure computation, automation, optimization, logic design, hardware description

9
August 2015 SEC'15: Proceedings of the 24th USENIX Conference on Security Symposium
Publisher: USENIX Association
Bibliometrics:
Citation Count: 2

Private Set Intersection (PSI) allows two parties to compute the intersection of private sets while revealing nothing more than the intersection itself. PSI needs to be applied to large data sets in scenarios such as measurement of ad conversion rates, data sharing, or contact discovery. Existing PSI protocols do not ...

10
May 2015 SP '15: Proceedings of the 2015 IEEE Symposium on Security and Privacy
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 6

We introduce Tiny Garble, a novel automated methodology based on powerful logic synthesis techniques for generating and optimizing compressed Boolean circuits used in secure computation, such as Yao's Garbled Circuit (GC) protocol. Tiny Garble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC. ...
Keywords: Secure Function Evaluation, Garbled Circuit, Logic Design, Hardware Synthesis

11 published by ACM
November 2014 CCSW '14: Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 110

Full text available: PDFPDF
Private Information Retrieval (PIR) allows to privately request a block of data from a database such that no information about the queried block is revealed to the database owner. With the rapid rise of cloud computing, data is often shared across multiple servers, making multi-server PIR a promising privacy-enhancing technology. ...
Keywords: cloud security, raid, private information retrieval, redundant array of inexpensive disks, applied cryptography, privacy enhancing technologies, secure storage

12
August 2014 SEC'14: Proceedings of the 23rd USENIX conference on Security Symposium
Publisher: USENIX Association
Bibliometrics:
Citation Count: 1

Secure two-party computation allows two mutually distrusting parties to jointly compute an arbitrary function on their private inputs without revealing anything but the result. An interesting target for deploying secure computation protocols are mobile devices as they contain a lot of sensitive user data. However, their resource restriction makes the ...

13
August 2014 SEC'14: Proceedings of the 23rd USENIX conference on Security Symposium
Publisher: USENIX Association
Bibliometrics:
Citation Count: 13

Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the intersection. It is one of the best studied applications of secure computation and many PSI protocols have been proposed. However, the variety of existing PSI ...

14 published by ACM
June 2014 IH&MMSec '14: Proceedings of the 2nd ACM workshop on Information hiding and multimedia security
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 12,   Downloads (12 Months): 87,   Downloads (Overall): 315

Full text available: PDFPDF
At WAHC'13, Bringer et al. introduced a protocol called SHADE for secure and efficient Hamming distance computation using oblivious transfer only. In this paper, we introduce a generalization of the SHADE protocol, called GSHADE, that enables privacy-preserving computation of several distance metrics, including (normalized) Hamming distance, Euclidean distance, Mahalanobis distance, ...
Keywords: oblivious transfer, biometrics, privacy, signal processing in the encrypted domain

15 published by ACM
June 2014 IH&MMSec '14: Proceedings of the 2nd ACM workshop on Information hiding and multimedia security
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 3,   Downloads (12 Months): 28,   Downloads (Overall): 216

Full text available: PDFPDF
Protocols for secure comparison are a fundamental building block of many privacy-preserving protocols such as privacy-preserving face recognition or privacy-preserving fingerprint authentication. So far, all existing secure comparison protocols that have been used in practical implementations require interaction. In recent work, Hsu et al. (IEEE Transactions on Image Processing 2012) ...
Keywords: homomorphic encryption, privacy-preserving comparison, signal processing in the encrypted domain

16 published by ACM
November 2013 CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Publisher: ACM
Bibliometrics:
Citation Count: 33
Downloads (6 Weeks): 14,   Downloads (12 Months): 109,   Downloads (Overall): 558

Full text available: PDFPDF
Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small ...
Keywords: secure computation, semi-honest adversaries, oblivious transfer extensions

17
June 2013 ACNS'13: Proceedings of the 11th international conference on Applied Cryptography and Network Security
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Mobile smart devices and services have become an integral part of our daily life. In this context there are many compelling scenarios for mobile device users to share resources. A popular example is tethering. However, sharing resources also raises privacy and security issues. In this paper, we present CrowdShare, a ...

18 published by ACM
May 2013 ASIA CCS '13: Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 199

Full text available: PDFPDF
Secure two-party computation is used as the basis for a large variety of privacy-preserving protocols, but often concerns about the low performance hinder the move away from non-private solutions. In this paper we present an improved implementation of Yao's garbled circuit protocol in the semi-honest adversaries setting which is up ...
Keywords: efficiency, garbled circuits, secure computation, privacy

19
March 2013 Journal of Computer Security: Volume 21 Issue 2, March 2013
Publisher: IOS Press
Bibliometrics:
Citation Count: 3

General two-party Secure Function Evaluation SFE allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs. Two-party SFE can benefit almost any client-server interaction where privacy is required, such as privacy-preserving credit checking, medical classification, or face recognition. Today, SFE is a ...
Keywords: Protocol Design, Garbled Functions, Framework, Homomorphic Encryption, Privacy-Preserving Protocols

20
August 2012
Bibliometrics:
Citation Count: 3

Secure two-party computation, called secure function evaluation (SFE), enables two mutually mistrusting parties, the client and server, to evaluate an arbitrary function on their respective private inputs while revealing nothing but the result. Originally the technique was considered to be too inefficient for practical privacy-preserving applications, but in recent years ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us