Filters








536 Hits in 5.8 sec

Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge [chapter]

Tore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi
2015 Lecture Notes in Computer Science  
Zero-Knowledge (ZK) protocols is one of these examples: In a recent paper Jawurek et al. [JKO13] showed that GCs can be used to construct efficient ZK proofs for unstructured languages.  ...  more efficient garbling schemes specifically tailored to this goal.  ...  We would like to thank Payman Mohassel and Benny Pinkas (for useful discussions), the authors of [KMR14] (for sharing with us an early copy of their manuscript and the result of their "safe ordering"  ... 
doi:10.1007/978-3-662-46803-6_7 fatcat:e7ipkleryvflrlrytfslqj53eq

Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic [chapter]

Yashvanth Kondi, Arpita Patra
2017 Lecture Notes in Computer Science  
Garbled circuits are of central importance in cryptography, finding widespread application in secure computation, zero-knowledge (ZK) protocols, and verifiable outsourcing of computation to name a few.  ...  We are interested in a particular kind of garbling scheme, termed privacy-free in the literature.  ...  Privacy-free garbling for formulas with size-zero GCs and information-theoretic security.  ... 
doi:10.1007/978-3-319-63688-7_7 fatcat:gae6qdbna5b7xokp2uoc7afiq4

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials [chapter]

Melissa Chase, Chaya Ganesh, Payman Mohassel
2016 Lecture Notes in Computer Science  
Existing techniques do not provide efficient solutions for proving knowledge of such a signature: On the one hand, ZK proofs based on garbled circuits (Jawurek et al. 2013) give efficient proofs for checking  ...  Other applications of our techniques include anonymous credentials with more complex policies, the ability to efficiently switch between commitments (and signatures) in different groups, and secure two-party  ...  If we split the computation into two garbled circuits with shared OT, then we can use the privacy free garbling scheme of [FNO15, ZRE15] for the first circuit as the verifier has no input, and use a  ... 
doi:10.1007/978-3-662-53015-3_18 fatcat:ze4h4lmpmnbk5kmnhfrpyemm5q

Efficient Secure Computation with Garbled Circuits [chapter]

Yan Huang, Chih-hao Shen, David Evans, Jonathan Katz, Abhi Shelat
2011 Lecture Notes in Computer Science  
In this paper, we show the potential of building privacy-preserving applications using garbled circuits, a generic technique that until recently was believed to be too inefficient to scale to realistic  ...  We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacypreserving applications.  ...  The authors thank Peter Chapman, Jiamin Chen, Yikan Chen, Michael Hicks, Sang Koo, Benjamin Kreuter, Aaron Mackey, Steven Myers, Mona Sergi, and Samee Zahur for their contributions to this project.  ... 
doi:10.1007/978-3-642-25560-1_2 fatcat:nimee4aiqrhqtgdtqgqj2scg64

Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits [chapter]

Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
2018 Lecture Notes in Computer Science  
The primary contribution of this work lies in constructing efficient UC-secure constant round ZK protocols from garbled circuits that are secure against adaptive corruptions, with communication linear  ...  Zero-knowledge (ZK) protocols are undoubtedly among the central primitives in cryptography, lending their power to numerous applications such as secure computation, voting, auctions, and anonymous credentials  ...  The authors would like to thank the anonymous reviewers for their feedback.  ... 
doi:10.1007/978-3-319-76581-5_17 fatcat:tjl2sphid5c4lpdtdkkzvd45bi

Outsourcing computation for private function evaluation

Henry Carter, Patrick Traynor
2019 International Journal of Information and Computer Security  
This novel garbling technique allows us to apply auxiliary circuits to check for malicious behavior using only free-XOR overhead gates rather than the significantly more costly PFE gate construction.  ...  Outsourcing secure multiparty computation (SMC) protocols has allowed resource-constrained devices to take advantage of these developing cryptographic primitives with great efficiency.  ...  [4] ) PFE garbling scheme and an efficient zero-knowledge circuit commitment, it would allow this protocol to be secure even in the presence of a malicious function holder.  ... 
doi:10.1504/ijics.2019.10024485 fatcat:bbyt2wyqubg5dkpikwxqmu6u5u

Zero-knowledge using garbled circuits

Marek Jawurek, Florian Kerschbaum, Claudio Orlandi
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
In this paper we address the problem of how to construct efficient zero-knowledge protocols for generic languages and we propose a protocol based on Yao's garbled circuit technique.  ...  Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications.  ...  We thank Yan Huang for his support with FastGC and his OT implementation, Stefan Tillich for his support with their circuits and Yael Ejgenberg for support for the SCAPI framework.  ... 
doi:10.1145/2508859.2516662 dblp:conf/ccs/JawurekKO13 fatcat:vrq5wfgz35bhzf25qqezgpp6rq

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

Privacy-Preserving ECG Classification With Branching Programs and Neural Networks

Mauro Barni, Pierluigi Failla, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, Thomas Schneider
2011 IEEE Transactions on Information Forensics and Security  
Sadeghi is with CASED (TU Darmstadt and Fraunhofer SIT),  ...  TABLE V COMPLEXITY V OF -PARALLEL OT PROTOCOL OF -BIT STRINGS invocations of are needed; each table entry and each garbled value has size TABLE VI EFFICIENT VI CIRCUIT CONSTRUCTIONS WITH FREE XOR Fig  ...  Garbled Circuits (GCs) for Boolean Circuits GCs are an efficient method for SFE of boolean circuits.  ... 
doi:10.1109/tifs.2011.2108650 fatcat:dehqbq6xifhsrefvseuhbmgt54

On Garbling Schemes with and Without Privacy [chapter]

Carsten Baum
2016 Lecture Notes in Computer Science  
In this note, we present an approach to combine such a privacy-free garbling scheme with an arbitrary SFE protocol for a certain class of circuits, such that the overall protocol is actively secure.  ...  Moreover, the total number of garbled circuits sent to the evaluator dropped by a factor of 3, mostly due to the Forge-and-Lose-technique [3, 18, 12] .  ...  Acknowledgements We would like to thank Ivan Damgård and Tore Frederiksen for helpful discussions.  ... 
doi:10.1007/978-3-319-44618-9_25 fatcat:adsfevtp2bdypetbvcymz7xdzi

Minutiae Matching with Privacy Protection Based on the Combination of Garbled Circuit and Homomorphic Encryption

Mengxing Li, Quan Feng, Jian Zhao, Mei Yang, Lijun Kang, Lili Wu
2014 The Scientific World Journal  
To improve the efficiency, we exploit homomorphic encryption as well as garbled circuits to design the protocol.  ...  Therefore, the protocol can run over open networks and help to alleviate the concerns on security and privacy of biometric applications over the open networks.  ...  Conflict of Interests We do not have a direct financial relation that might lead to a conflict of interests for any of the authors.  ... 
doi:10.1155/2014/525387 pmid:24711729 pmcid:PMC3953427 fatcat:kqd2oowznvbwjdmjx2gxq7slqa

A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider
2013 Journal of Computer Security  
We argue that in many cases the most efficient SFE protocols are obtained by combining several basic techniques, e.g., garbled circuits and (additively) homomorphic encryption.  ...  As a valuable methodological contribution, we present a framework in which today's most efficient techniques for general SFE can be viewed as building blocks with well-defined interfaces that can be easily  ...  Acknowledgments The authors would like to thank Juan Garay and the anonymous reviewers of the Journal of Computer Security for their helpful comments.  ... 
doi:10.3233/jcs-130464 fatcat:h3e2udfufrcetpf2pbzz6z6mru

TASTY

Wilko Henecka, Stefan K ögl, Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
We use TASTY to compare protocols for secure multiplication based on homomorphic encryption with those based on garbled circuits and highly efficient Karatsuba multiplication.  ...  TASTY allows to automatically generate efficient secure protocols for many privacy-preserving applications where we consider the use cases for private set intersection and face recognition protocols.  ...  Garbled Circuits (GC). We use the GC construction with free XORs and garbled row reduction of [44] secure in the random-oracle model.  ... 
doi:10.1145/1866307.1866358 dblp:conf/ccs/HeneckaKSSW10 fatcat:vu3zcsodhbbexhsamaxv64xwra

Robust privacy-preserving fingerprint authentication

Ye Zhang, Farinaz Koushanfar
2016 2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)  
Our method is provably secure by leveraging Yao's Garbled Circuit (GC) protocol.  ...  While the concept of using GC for secure fingerprint matching has been suggested earlier, to the best of our knowledge, no prior reliable method or implementation applicable to real fingerprint data has  ...  Even with protocol-level improvements, their implementation is still impractical for real applications due to the lack of efficiency using HE.  ... 
doi:10.1109/hst.2016.7495547 dblp:conf/host/ZhangK16 fatcat:zs4kstdv3ng2zldog2bsuzkn3e

GarbledCPU

Ebrahim M. Songhori, Shaza Zeitouni, Ghada Dessouky, Thomas Schneider, Ahmad-Reza Sadeghi, Farinaz Koushanfar
2016 Proceedings of the 53rd Annual Design Automation Conference on - DAC '16  
Our MIPS-based implementation enables development of applications (functions) in a high-level language while performing secure function evaluation (SFE) using Yao's garbled circuit protocol in hardware  ...  Garbled-CPU provides three degrees of freedom for SFE which allow leveraging the trade-off between privacy and performance: public functions, private functions, and semi-private functions.  ...  Hence, garbling a limited application-specific IS for executing each instruction is sufficient to achieve privacy. In §5.3 we show three examples of GarbledCPU with application-specific IS.  ... 
doi:10.1145/2897937.2898027 dblp:conf/dac/SonghoriZD0SK16 fatcat:zsv5ngejk5fhflu6qkbnifspoq
« Previous Showing results 1 — 15 out of 536 results