347 Hits in 5.5 sec

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing [chapter]

Mihir Bellare, Viet Tung Hoang, Phillip Rogaway
2012 Lecture Notes in Computer Science  
But some applications-notably one-time programs (Goldwasser, Kalai, and Rothblum 2008) and secure outsourcing (Gennaro, Gentry, Parno 2010)-need adaptive security, where x may depend on F .  ...  We show how adaptively secure garbling schemes support simple solutions for one-time programs and secure outsourcing, with privacy being the goal in the first case and obliviousness and authenticity the  ...  Thanks to the ASIACRPYT reviewers for their helpful comments, and thanks to the NSF for their continuing support: Bellare was supported in part by NSF grants CNS-1116800, CNS 0904380 and CCF-0915675, while  ... 
doi:10.1007/978-3-642-34961-4_10 fatcat:72hjafx5t5bfnlkpbcbek4bcnu

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

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
When two or more parties need to compute a common result while safeguarding their sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled circuits.  ...  This paper revisits the history of improvements to SMC over the years and considers the possibility of coupling trusted hardware with SMC.  ...  Acknowledgments Special thanks are due to Patrick Traynor and Thomas Shrimpton for their interest in and constructive criticisms of this work.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34

Maturity and Performance of Programmable Secure Computation

David W. Archer, Dan Bogdanov, Benny Pinkas, Pille Pullonen
2016 IEEE Security and Privacy  
In the European Union, the PRACTICE program (2013-2016) focuses on its use to secure cloud computing. Both programs have demonstrated exceptional prototypes and performance improvements.  ...  [CLT14a] Henry Carter, Charles Lever, and Patrick Traynor. Whitewash: outsourcing garbled circuit generation for mobile devices.  ... 
doi:10.1109/msp.2016.97 fatcat:6drshm66cvhsznobop2tb7g4ly

Garbled RAM Revisited [chapter]

Craig Gentry, Shai Halevi, Steve Lu, Rafail Ostrovsky, Mariana Raykova, Daniel Wichs
2014 Lecture Notes in Computer Science  
In particular, the size of the garbled program and the time it takes to create and evaluate it are only proportional to its running time on a RAM rather than its circuit size.  ...  In particular, the size of the garbled program as well as the evaluation time should only be proportional to the running-time of the program on a RAM (up to poly-logarithmic factors), rather than the size  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon.  ... 
doi:10.1007/978-3-642-55220-5_23 fatcat:y7zxna3mdbgpfcs7tmwfpjhlsm

A Pragmatic Introduction to Secure Multi-Party Computation

David Evans, Vladimir Kolesnikov, Mike Rosulek
2018 Foundations and Trends® in Privacy and Security  
Outsourced Computation In an outsourced computation, one party owns the data and wants to be able to obtain the result of computation on that data.  ...  "How to circumvent the twociphertext lower bound for linear garbling schemes". In: International Conference on the Theory and Application of Cryptology and Information Security. Springer. 967-997.  ... 
doi:10.1561/3300000019 fatcat:igylrqmmijeoviw772oaiudvki

How to Garble RAM Programs? [chapter]

Steve Lu, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
Assuming solely the existence of one-way functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running  ...  Our result requires the existence of one-way function and enjoys the same non-interactive properties as Yao's original garbled circuits.  ...  Acknowledgements We thank Oded Goldreich and Daniel Wichs for very helpful discussions and the anonymous reviewers for their comments.  ... 
doi:10.1007/978-3-642-38348-9_42 fatcat:ykszm343lngqjmyffbjnue5oym

Raziel: Private and Verifiable Smart Contracts on Blockchains [article]

David Cerezo Sánchez
2020 arXiv   pre-print
Raziel combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains.  ...  Effectively solving DAO and Gyges attacks, this paper describes an implementation and presents examples to demonstrate its practical viability (e.g., private and verifiable crowdfundings and investment  ...  Acknowledgments I would like to thank David Evans and Jonathan Katz for helpful comments on the paper.  ... 
arXiv:1807.09484v2 fatcat:ksncs6sm4bclfkhw6vhmfeqbdu

Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs [chapter]

Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider
2010 Lecture Notes in Computer Science  
A recent approach, One-Time Programs (OTPs), proposes using Yao's Garbled Circuit (GC) and very simple tamper-proof hardware to securely implement oblivious transfer, to guarantee leakage resilience.  ...  This direction is, however, very new and still largely lacks practitioners' evaluation with regard to both efficiency and practical security.  ...  We thank anonymous reviewers of CHES'10 for their helpful comments and co-authors of [40] for the initial AES circuit.  ... 
doi:10.1007/978-3-642-15031-9_26 fatcat:7ttfkwfdljcu7a2oyt3yrhukam

CryptoDSPs for Cloud Privacy [chapter]

Juan Ramón Troncoso-Pastoriza, Fernando Pérez-González
2011 Lecture Notes in Computer Science  
This fact, together with the advent of Cloud computing and the growing tendency to outsource not only the storage but also the processing of data has created a fundamental need for privacy preserving techniques  ...  We provide a landscape of technologies brought up by the novel discipline of Signal Processing in the Encrypted Domain (SPED), and we show their application to solve Cloud Computing privacy issues, introducing  ...  processing application can be built up on top of this secure middleware in order to be endowed with the required level of privacy.  ... 
doi:10.1007/978-3-642-24396-7_34 fatcat:j3oo4fergzeqrnejmwfutfexva

Secure Publish-Process-Subscribe System for Dispersed Computing [article]

Weizhao Jin, Bhaskar Krishnamachari, Muhammad Naveed, Srivatsan Ravi, Eduard Sanou, Kwame-Lante Wright
2021 IACR Cryptology ePrint Archive  
We evaluate our system on several functions and also demonstrate real-world applications based on it.  ...  for most functions but with a different security assumption and a simpler system structure.  ...  Carter et al. also proposed a maliciously secure protocol that outsources garbled circuit evaluation but uses a new oblivious transfer mechanism to reduce bandwidth and computation [15] .  ... 
dblp:journals/iacr/JinKNRSW21 fatcat:i6lz5ncbejbrtad5smzpabieia

Delegating RAM Computations with Adaptive Soundness and Privacy [chapter]

Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin
2016 Lecture Notes in Computer Science  
on the encodings of the database and previously chosen programs.  ...  We then apply this technique to the delegation scheme of Chen et al. and its selective security proof, obtaining that their scheme is essentially already adaptively secure.  ...  In general, a garbling scheme to garble RAM programs and persistent database consists of four algorithms: the first one is to generate a secret key and garble initial database, the second one is to garble  ... 
doi:10.1007/978-3-662-53644-5_1 fatcat:gvzzqfmvz5aflgnh3rhbrwd644

Garbled RAM From One-Way Functions

Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro
2015 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15  
It can be seen as a RAM analogue of Yao's garbled circuits such that, the size of the garbled program and the time it takes to create and evaluate it, is proportional only to the running time on the RAM  ...  In this paper we provide the first construction with strictly poly-logarithmic overhead in both space and time based only on the minimal and necessary assumption that one-way functions exist.  ...  We believe this will be of independent interest in various outsourcing computation applications. We provide a motivating example application to the pre-processing model below.  ... 
doi:10.1145/2746539.2746593 dblp:conf/stoc/GargLOS15 fatcat:hy3fnzvknvfjxk5zmmnnmpoveq

Succinct Randomized Encodings and their Applications

Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang
2015 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15  
We construct succinct randomized encodings where the time to encode a computation, given by a program Π and input x, is essentially independent of Π's time complexity, and only depends on its space complexity  ...  Existing randomized encodings, geared mostly to allow encoding with low parallel-complexity, have proven instrumental in various strong applications such as multiparty computation and parallel cryptography  ...  Acknowledgements We thank Boaz Barak and Guy Rothblum for their input regarding the plausibility of interactive proofs with fast verification (relevant to the plausibility of perfectly-private succinct  ... 
doi:10.1145/2746539.2746574 dblp:conf/stoc/BitanskyGLPT15 fatcat:xh456jdiz5aivdovp56tnb4ugq

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  
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  ...  resident match with more than 35,000 participants and 30,000 residency slots.  ...  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

Ad-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens

Daniel Demmler, Thomas Schneider, Michael Zohner
2014 USENIX Security Symposium  
For private set intersection, our token-aided implementation on mobile phones is up to two orders of magnitude faster than previous generic secure two-party computation protocols on mobile phones and even  ...  In this work, we optimize and implement the secure computation protocol by Goldreich-Micali-Wigderson (GMW) on mobile phones.  ...  Acknowledgements We thank the anonymous reviewers of USENIX Security 2014 for their helpful comments on our paper.  ... 
dblp:conf/uss/Demmler0Z14 fatcat:yhw7hk65fvgkhmi2csvcnw4vwm
« Previous Showing results 1 — 15 out of 347 results