International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 6000 results
Privacy Preserving Data Mining
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1574
Yehuda Lindell Benny Pinkas
Crypto 2000
Privacy Preserving Data Mining
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=14225
Yehuda Lindell Benny Pinkas
Jofc 2002
Secure Multiparty Computation for Privacy-Preserving Data Mining
Eprint
https://eprint.iacr.org/2008/197
Yehuda Lindell Benny Pinkas
In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for...
received 6 May 2008
Privacy-preserving Frequent Itemset Mining for Sparse and Dense Data
Eprint
https://eprint.iacr.org/2015/671
Peeter Laud Alisa Pankova
Frequent itemset mining is a task that can in turn be used for other purposes such as associative rule mining. One problem is that the data may be sensitive, and its owner may refuse to give it for analysis in plaintext. There...
received 3 Jul 2015
IACR crypto 2011
https://iacr.org/archive/crypto2011/crypto2011-index.html
CRYPTO 2011: Phillip Rogaway (Ed.): Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011 Proceedings. CRYPTO 2011 Preface by Phillip Rogaway (Ed.): Organizational...
TCC 2011
https://iacr.org/workshops/tcc2011/rumpsession.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence, Rhode Island, USA This page requires iframes. Rump Session 8:00-8:02 Welcome. Tal Malkin 8:02-8:12 Official business . Oded...
IACR CRYPTO 2000: Santa Barbara, California, USA
https://iacr.org/archive/crypto2000/crypto2000.html
IACR CRYPTO 2000 : Santa Barbara, California, USA Mihir Bellare (Ed.): Advances in Cryptology - CRYPTO 2000 , 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000 , Proceedings....
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=29485
Yehuda Lindell Benny Pinkas
Jofc 2012
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of...
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Eprint
https://eprint.iacr.org/2010/284
Yehuda Lindell Benny Pinkas
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of...
last revised 29 Oct 2014
Unknown
https://iacr.org/conferences/crypto2011/accepted-papers-list.htm
Papers Accepted to CRYPTO 2011 Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups . Masayuki Abe (NTT Information Sharing Platform Labs), Jens Groth (University College London), Kristiyan Haralambiev (NYU),...
Secure Computation of the Mean and Related Statistics
Eprint
https://eprint.iacr.org/2004/359
Eike Kiltz Gregor Leander John Malone-Lee
In recent years there has been massive progress in the development of technologies for storing and processing of data. If statistical analysis could be applied to such data when it is distributed between several organisations,...
received 15 Dec 2004
TCC 2011
https://iacr.org/workshops/tcc2011/accepted.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence, Rhode Island, USA This page requires iframes. TCC 2011 Accepted Papers Secure Two-Party Computation via Cut-and-Choose...
TCC 2011
https://iacr.org/workshops/tcc2011/accepted-dec14.html
Eighth IACR Theory of Cryptography Conference TCC 2011 March 28-30, 2011, Brown University Providence, Rhode Island, USA This page requires iframes. TCC 2011 Accepted Papers Secure Two-Party Computation via Cut-and-Choose...
IACR TCC 2011
https://iacr.org/archive/tcc2011/tcc2011-index.html
TCC 2011: Yuval Ishai (Eds.): Theory of Cryptography - 8th Theory of Cryptography Conference - TCC 2011, TCC 2011, Providence, RI, USA, March 28-30, 2011 Proceedings. TCC 2011 Providence, RI, USA, March 28-30, 2011 Preface by...
Privacy-Preserving Search of Similar Patients in Genomic Data
Eprint
https://eprint.iacr.org/2017/144
Gilad Asharov Shai Halevi Yehuda Lindell Tal Rabin
The growing availability of genomic data holds great promise for advancing medicine and research, but unlocking its full potential requires adequate methods for protecting the privacy of individuals whose genome data we use....
last revised 10 Jun 2018
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23524
Yehuda Lindell Benny Pinkas
Tcc 2011
Secure Computation on the Web: Computing without Simultaneous Interaction
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23572
Shai Halevi Yehuda Lindell Benny Pinkas
Crypto 2011
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=23579
Yehuda Lindell Eli Oxman Benny Pinkas
Crypto 2011
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27291
Yehuda Lindell Benny Pinkas Nigel P. Smart Avishay Yanai
Crypto 2015
Fast Garbling of Circuits Under Standard Assumptions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28503
Shay Gueron Yehuda Lindell Ariel Nof Benny Pinkas
Jofc 2018
Next ►