Filters








10 Hits in 7.8 sec

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
This paper also addresses three open challenges: (1) defeating malicious adversaries, (2) mobile-friendly TEE-supported SMC, and (3) a more general coupling of trusted hardware and privacy-preserving computation  ...  The traditional enabler of SMC is cryptography, but the significant number of cryptographic operations required results in these techniques being impractical for most real-time, online computations.  ...  This work is supported in part by the US National Science Foundation under grant CNS-1540217.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34

Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values [article]

Benjamin Mood, Debayan Gupta, Kevin Butler, Joan Feigenbaum
2015 arXiv   pre-print
The reuse of previous inputs to allow stateful evaluation represents a new way of looking at SFE and further reduces computational barriers.  ...  We also use PartialGC to build a privacy-preserving "friend finder" application for Android.  ...  The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
arXiv:1506.02954v1 fatcat:efd6g344dvgahgszec6ms3ophe

Reuse It Or Lose It

Benjamin Mood, Debayan Gupta, Kevin Butler, Joan Feigenbaum
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
The reuse of previous inputs to allow stateful evaluation represents a new way of looking at SFE and further reduces computational barriers.  ...  We also use PartialGC to build a privacy-preserving "friend-finder" application for Android.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1145/2660267.2660285 dblp:conf/ccs/MoodGBF14 fatcat:ijoernk4ojfdvaado7jpscznfi

Secure Stable Matching at Scale

Jack Doerner, David Evans, abhi shelat
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
The resulting protocol is efficient enough to be useful at the scale required for matching medical residents nationwide, taking just over 18 hours to complete an execution simulating the 2016 national  ...  When a group of individuals and organizations wish to compute a stable matching-for example, when medical students are matched to medical residency programs-they often outsource the computation to a trusted  ...  Acknowledgments The authors thank Samee Zahur for insightful conversations about this work and assistance with Obliv-C and ORAM, and Elaine Shi for constructive comments and advice.  ... 
doi:10.1145/2976749.2978373 dblp:conf/ccs/DoernerES16 fatcat:4wgv35kgwrhg5ob6ognyarchf4

Secure OMP Based Pattern Recognition that Supports Image Compression

Takayuki Nakachi
2020 Zenodo  
The encryption is carried out by using a random unitary transform. The proposed scheme offers two prominent features. 1) It is capable of pattern recognition that works in the encrypted image domain.  ...  The proposal is shown to realize human detection with encrypted images and efficiently compress the images selected in the image recognition stage.  ...  Weinstein, "Optimized honest-majority mpc for malicious adversaries -breaking the 1 billion-gate per second barrier, IEEE Symposium on Security and Privacy (SP), pp. 843-862, 2017. [5] Y. Aono and T.  ... 
doi:10.5281/zenodo.3865183 fatcat:mnjthkimobbeppaxiuu5mtmnbi

Practical Private Set Intersection Protocols for Privacy-Preserving Applications

Christian Weinert
2021
(PoPETs'17) while also providing security against malicious clients.  ...  To instead perform the matching procedure between address books and user databases in a privacy-preserving manner, we develop and optimize two PSI protocols that are significantly more efficient than the  ...  Acknowledgments This work was co-funded by the DFG as part of project E4 within the CRC 1119 CROSSING and project A. 1 Acknowledgments.  ... 
doi:10.26083/tuprints-00019295 fatcat:mcrri3mvh5a3jois3hzpolx3ae

Blockchain Scalability through Secure Optimistic Protocols

Lisa Eckey
2020
The next contribution of this dissertation is the FairSwap protocol, which aims at reducing the costs for the secure sale of large digital goods.  ...  This allows an operator to execute the smart contracts on inputs from the users off-chain, which makes the execution much faster and cheaper for all participants.  ...  Acknowledgments The four years of being a doctoral student was a true journey for me -starting in Bochum and ending in Darmstadt, it brought me to many exciting destinations on  ... 
doi:10.25534/tuprints-00014041 fatcat:4xyemvgjmzebvlbckwe6fz2tyy

Protocols for Connecting Blockchains with Off-chain Systems

Fan Zhang
2020
Fellow for 2018-2020. His research interest is in the security of decentralized systems, in particular those enabled by blockchains and trusted execution environments (TEEs).  ...  The systems presented in this thesis advance the state of the art of smart contract capabilities.  ...  First, they break legacy compatibility, causing a significant barrier to wide adoption.  ... 
doi:10.7298/jw55-g827 fatcat:2f6qobvuvzenllmhxgoubz7woe

Security Strategies and Blockchain Functionalities for Genomics Analytics in Bioinformatics

Abukari Mohammed Yakubu
2022
A thesis submitted in total fulfilment of the requirements for the degree of Doctor of Philosophy to the Department of Computer Science and Information Technology, School of Engineering and Mathematical  ...  per second.  ...  Also, adversarial models based on assumptions of semi-honest and non-colluding parties should be adopted for a more practical and realistic setting of a malicious adversary.  ... 
doi:10.26181/19721524.v1 fatcat:t7oyqm4qanc6no6xtm4okg4u2e

MessageVortex Transport Independent, Unobservable, and Unlinkable Messaging

Martin Gwerder
2021
Tschudin and the University of Basel for the opportunity of writing this work and for the challenges they posed me, allowing me to grow. Dr.  ...  I want to acknowledge all the individuals who have coded for the L A T E X project for free. Due to their efforts, we can generate professionally typeset PDFs (and far more) for free.  ...  Thinking is the hardest work there is, which is probably the reason, so few engage in it. Henry Ford, American industrialist and founder of Ford Motor Co.  ... 
doi:10.5451/unibas-ep84631 fatcat:rsg5cjuzrvex7a2lrcnuldtuqa