Author image not provided
 Michael Zohner

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.22
Citation Count74
Publication count9
Publication years2012-2017
Available for download3
Average downloads per article330.33
Downloads (cumulative)991
Downloads (12 Months)211
Downloads (6 Weeks)32
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


10 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 10 of 10
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
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

3
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 ...

4
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 ...

5
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 ...

6 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

7 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

8
May 2012 COSADE'12: Proceedings of the Third international conference on Constructive Side-Channel Analysis and Secure Design
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

In this contribution we propose the so-called SVM attack, a profiling based side channel attack, which uses the machine learning algorithm support vector machines (SVM) in order to recover a cryptographic secret. We compare the SVM attack to the template attack by evaluating the number of required traces in the ...

9
May 2012 COSADE'12: Proceedings of the Third international conference on Constructive Side-Channel Analysis and Secure Design
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

At the cutting edge of todays security research and development, the SHA-3 contest evaluates a new successor of SHA-2 for secure hashing operations. One of the finalists is the SHA-3 candidate <em>Skein</em> . Like many other cryptographic primitives Skein utilizes arithmetic operations, for instance modular addition. In this paper we ...
Keywords: SHA-3, skein, modular addition, butterfly-attack, side-channel

10
March 2012 DATE '12: Proceedings of the Conference on Design, Automation and Test in Europe
Publisher: EDA Consortium
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 8,   Downloads (Overall): 44

Full text available: PDFPDF
At the cutting edge of today's security research and development, the SHA-3 competition evaluates a new secure hashing standard in succession to SHA-2. The five remaining candidates of the SHA-3 competition are BLAKE, Grøstl, JH, Keccak, and Skein. While the main focus was on the algorithmic security of the candidates, ...
Keywords: DPA, SHA-3 finalists, side-channel analysis



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