Filters








3,441 Hits in 4.3 sec

Private Mutual Authentication and Conditional Oblivious Transfer [chapter]

Stanisław Jarecki, Xiaomin Liu
2009 Lecture Notes in Computer Science  
Our protocols rely on a novel technical tool, a family of efficient Private Conditional Oblivious Transfer (COT) protocols, secure under DDH, for languages defined by modular arithmetic constraints (e.g  ...  We construct the first realization of such private authentication using O(1) exponentiations and bilinear maps, secure under Strong Diffie-Hellman and Decisional Linear assumptions.  ...  The authors want to thank Anna Lysyanskaya and Yuval Ishai for stimulating discussions, and Gene Tsudik for frequent productive discussions and for a crucial suggestion which triggered this work, namely  ... 
doi:10.1007/978-3-642-03356-8_6 fatcat:l35nstx2dvf6lengoi2zkf4a4u

Private search on key-value stores with hierarchical indexes

Haibo Hu, Jianliang Xu, Xizhong Xu, Kexin Pei, Byron Choi, Shuigeng Zhou
2014 2014 IEEE 30th International Conference on Data Engineering  
Fortunately, recent advances in cryptography bring us two relevant tools -conditional oblivious transfer and homomorphic encryption.  ...  In this paper, we integrate database indexing techniques with these tools in the context of private search on key-value stores.  ...  Conditional oblivious transfer (COT), proposed by Crescenzo et al.  ... 
doi:10.1109/icde.2014.6816687 dblp:conf/icde/HuXXPCZ14 fatcat:wpb63gvmsrfaxoxb7fnrsxnbbe

Quantum Oblivious Mutual Identification [chapter]

Claude Crépeau, Louis Salvail
1995 Lecture Notes in Computer Science  
We consider a situation where two parties, Alice and Bob, share a common secret string and would like to mutually check their knowledge of that string.  ...  We describe a simple and e cient protocol based on the exchange of quantum information to check mutual knowledge of a common string in such a way that honest parties will always succeed in convincing each  ...  Acknowledgments We would like to thank Thomas Beth, Gilles Brassard, Artur Ekert, Richard Jozsa, Denis Langlois, and Bill Wootters for their interest in this research.  ... 
doi:10.1007/3-540-49264-x_11 fatcat:g6kjeps6pvbw3gqqn2kjd3vezm

A Pragmatic Introduction to Secure Multi-Party Computation

David Evans, Vladimir Kolesnikov, Mike Rosulek
2018 Foundations and Trends® in Privacy and Security  
Ohara. 2016 • Web security and privacy Asharov, G., Y.Lindell, T. Schneider, and M. Zohner. 2015b. "More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries".  ...  Orsini, and P. Scholl. 2016. "MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer". In: ACM CCS 16: 23rd Conference on Computer and Communications Security. Ed. by E. R.  ... 
doi:10.1561/3300000019 fatcat:igylrqmmijeoviw772oaiudvki

Information-Theoretic Cryptography [chapter]

Ueli Maurer
1999 Lecture Notes in Computer Science  
Unconditionally-secure secrecy, authentication, and key agreement are reviewed.  ...  The general concept of an information-theoretic cryptographic primitive is proposed which covers many previously considered primitives like oblivious transfer, noisy channels, and multi-party computation  ...  Above all, I am grateful to Jim Massey who introduced me to information theory and cryptography. I also thank Michael Wiener and the Crypto 99 program committee for inviting me to give this lecture.  ... 
doi:10.1007/3-540-48405-1_4 fatcat:ukcurnwa4naxxjnunmqgz7kcwm

Quantum oblivious set-member decision protocol

Run-hua Shi, Yi Mu, Hong Zhong, Shun Zhang
2015 Physical Review A. Atomic, Molecular, and Optical Physics  
We present and define a privacy-preserving problem called the oblivious set-member decision problem, which allows a server to decide whether a private secret of a user is a member of his private set in  ...  Namely, if the secret belongs to his private set, he does not know which member it is. We propose a quantum solution to the oblivious set-member decision problem.  ...  ACKNOWLEDGMENTS This work was supported by National Natural Science Foundation of China (61173187, 61173188 and 11301002), the Ministry of Education institution of higher learning doctor discipline and  ... 
doi:10.1103/physreva.92.022309 fatcat:ddevyxl24neg7at5isk5vbgcue

Efficient Password Authenticated Key Exchange via Oblivious Transfer [chapter]

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee
2012 Lecture Notes in Computer Science  
We present a new framework for constructing efficient password authenticated key exchange (PAKE) protocols based on oblivious transfer (OT).  ...  Instead, we rely on oblivious transfer (OT) as the main cryptographic building block. We obtain new PAKE protocols  ...  Key Exchange via Oblivious Transfer  ... 
doi:10.1007/978-3-642-30057-8_27 fatcat:s7djr2lmenflxbmhdg2hejbmoi

Cryptographic Randomized Response Techniques [chapter]

Andris Ambainis, Markus Jakobsson, Helger Lipmaa
2004 Lecture Notes in Computer Science  
Our constructions are efficient and practical, and are shown not to allow cheating respondents to affect the "tally" by more than their own vote-which will be given the exact same weight as that of other  ...  We demonstrate solutions to this problem based on both traditional cryptographic techniques and quantum cryptography.  ...  Seppänen and Benny Pinkas for useful comments.  ... 
doi:10.1007/978-3-540-24632-9_31 fatcat:ffifq4pxvrcdzbyx6fxlpilwsa

Intersection-policy private mutual authentication from authorized private set intersection

Yamin Wen, Fangguo Zhang, Huaxiong Wang, Yinbin Miao, Zheng Gong
2020 Science China Information Sciences  
oblivious transfer [1] , and group signature [26, 27] ).  ...  Derived from the presented IBE-APSI, our proposed IP-PMA also realizes the intersection policies for private mutual authentications.  ... 
doi:10.1007/s11432-019-9907-x fatcat:gxzpb57jtbcbhfc6ixrxmtcthy

More Robust Multiparty Protocols with Oblivious Transfer [article]

J. Mueller-Quade
2001 arXiv   pre-print
This paper presents more robust solutions for multiparty protocols with oblivious transfer.  ...  These allow the implementation of oblivious transfer and the protocols of this paper relative to temporary assumptions, i.e., the security increases after the termination of the protocol.  ...  In the following we will always think of the oblivious transfer channel as being a stronger primitive than authenticated private channels.  ... 
arXiv:cs/0101020v2 fatcat:jbqildidifdbrbium6jyolduge

Secure Collaborative Training and Inference for XGBoost [article]

Andrew Law, Chester Leung, Rishabh Poddar, Raluca Ada Popa, Chenyu Shi, Octavian Sima, Chaofan Yu, Xingmeng Zhang, Wenting Zheng
2020 arXiv   pre-print
We propose Secure XGBoost, a privacy-preserving system that enables multiparty training and inference of XGBoost models.  ...  Crucially, Secure XGBoost augments the security of the enclaves using novel data-oblivious algorithms that prevent access side-channel attacks on enclaves induced via access pattern leakage.  ...  Ericsson, Facebook, Futurewei, Google, Intel, Microsoft, Nvidia, Scotiabank, Splunk, and VMware.  ... 
arXiv:2010.02524v1 fatcat:mh5gmhwqefe7lfh25jet2jgpzq

Cryptographic techniques for privacy-preserving data mining

Benny Pinkas
2002 SIGKDD Explorations  
We describe these results, discuss their efficiency, and demonstrate their relevance to privacy preserving computation of data mining algorithms.  ...  The main building block -oblivious transfer Oblivious transfer is a basic protocol that is the main building block of secure computation.  ...  The notion of 1-out-2 oblivious transfer was suggested by Even, Goldreich and Lempel [7] (as a variant of a different but equivalent type of oblivious transfer that has been suggested by Rabin [17]  ... 
doi:10.1145/772862.772865 fatcat:p36zbd3yvfbibacpsmxoqko5yy

Oblivious Polynomial Evaluation

Moni Naor, Benny Pinkas
2006 SIAM journal on computing (Print)  
We describe several such applications, including protocols for private comparison of data, for mutually authenticated key exchange based on (possibly weak) passwords, and for anonymous coupons. * This  ...  paper is the full version of the sections that describe oblivious polynomial evaluation in "Oblivious Transfer and Polynomial Evaluation", 31st STOC, 1999.  ...  Acknowledgments We would like to thank Sanjeev Arora, Daniel Bleichenbacher, Dan Boneh, Oded Goldreich, Yuval Ishai, Amit Klein, Ronitt Rubinfeld, Madhu Sudan, and the anonymous referees that reviewed  ... 
doi:10.1137/s0097539704383633 fatcat:ozj7gmdd5vaand6rfdcfowj4hm

Some Like It Private: Sharing Confidential Information Based on Oblivious Authorization

Emiliano De Cristofaro, Jihye Kim
2010 IEEE Security and Privacy  
Consider the following: the University of Springfield is confronted with an FBI investigation concerning one Privacy-Preserving Policy-Based Information Transfer (PPIT) lets entities that lack mutual trust  ...  Oblivious Transfer (OT) 3 allows a receiver to obliviously obtain one message from a set offered by a sender.  ...  The necessary condition upon key establishment is the oblivious verification of a digital signature, meaning that the data owner doesn't learn the outcome of such verification.  ... 
doi:10.1109/msp.2010.91 fatcat:o5znjnis2bcc3kwgnsiojdswli

Secure Two-Party Computation in Applied Pi-Calculus: Models and Verification [chapter]

Sergiu Bursuc
2016 Lecture Notes in Computer Science  
Furthermore, even for classic protocols such as Yao's (based on garbled circuits and oblivious transfer), we do not have adequate symbolic models for cryptographic primitives and protocol roles, that can  ...  Our contributions, formulated in the context of Yao's protocol, include: an equational theory for specifying the primitives of garbled computation and oblivious transfer; process specifications for the  ...  This is where A and B rely on oblivious transfer [15, 16] .  ... 
doi:10.1007/978-3-319-28766-9_1 fatcat:gi6ccgvdefe5lneeech7qhbszq
« Previous Showing results 1 — 15 out of 3,441 results