243 Hits in 10.5 sec

Communication Locality in Secure Multi-party Computation [chapter]

Elette Boyle, Shafi Goldwasser, Stefano Tessaro
2013 Lecture Notes in Computer Science  
We solve this challenge, and we provide a protocol for securely computing such sublinear f that runs in polylog(n) + O(q) rounds, has each party communicating with at most q · polylog(n) other parties,  ...  We devise multi-party computation protocols for general secure function evaluation with the property that each party is only required to communicate with a small number of dynamically chosen parties.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1007/978-3-642-36594-2_21 fatcat:4app2lqdhnh3doehcg5z7qcprq

The Bottleneck Complexity of Secure Multiparty Computation

Elette Boyle, Abhishek Jain, Manoj Prabhakaran, Ching-Hua Yu, Michael Wagner
2018 International Colloquium on Automata, Languages and Programming  
While achieving O(n) bottleneck complexity (where n is the number of parties) is straightforward, we show that: (1) achieving sublinear bottleneck complexity is not always possible, even when no security  ...  Along the way, we build cryptographic primitives -incremental fully-homomorphic encryption, succinct non-interactive arguments of knowledge with ID-based simulation-extractability property and verifiable  ...  For security against active corruption (possibly for restricted auxiliary information), we build zero-knowledge succinct non-interactive arguments of knowledge (ZK-SNARK [2] ) with an"ID-based" simulation-extractability  ... 
doi:10.4230/lipics.icalp.2018.24 dblp:conf/icalp/Boyle0PY18 fatcat:zfihafhqkfbijhgbjvdcfe4tpy

Recent Results in Scalable Multi-Party Computation [chapter]

Jared Saia, Mahdi Zamani
2015 Lecture Notes in Computer Science  
Secure multi-party computation (MPC) allows multiple parties to compute a known function over inputs held by each party, without any party having to reveal its private input.  ...  We describe the advantages and disadvantages of these scalable algorithms, and we propose new ideas for improving practicality of current techniques.  ...  The solution provided in [BGW88] requires a zero-knowledge proof, where each party is asked to prove distribution of shares over a polynomial with zero free-coefficient.  ... 
doi:10.1007/978-3-662-46078-8_3 fatcat:37fhqleqvzdarox23nnlnl3gyq

Sublinear Zero-Knowledge Arguments for RAM Programs [chapter]

Payman Mohassel, Mike Rosulek, Alessandra Scafuro
2017 Lecture Notes in Computer Science  
Known sublinear zero-knowledge proofs either require an initialization phase where the work of the verifier is proportional to |M | and are therefore sublinear only in an amortized sense, or require that  ...  We describe a new succinct zero-knowledge argument protocol with the following properties.  ...  There are several existing techniques for zero-knowledge proofs/arguments that have sublinear cost: PCP techniques: Kilian [27] and Micali [30] were the first to describe proof systems in which the  ... 
doi:10.1007/978-3-319-56620-7_18 fatcat:vdww6gveljdgzahdjnvfojbasq

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam Smith
2014 Journal of Cryptology  
to minimize the communication in secure computation protocols.  ...  We apply this technique to both standard non-interactive zero-knowledge proofs and to universally composable non-interactive zero-knowledge proofs.  ...  Computational zero-knowledge follows from the computational zero-knowledge of (K F , P F , V F ), the pseudorandomness of G and the IND-CPA security of (K FHE , E, D, Eval).  ... 
doi:10.1007/s00145-014-9184-y fatcat:xseoys3j2jdqfpuli2f4acvvhe

Separating succinct non-interactive arguments from all falsifiable assumptions

Craig Gentry, Daniel Wichs
2011 Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11  
In this paper, we study succinct computationally sound proofs (arguments) for N P, whose communication complexity is polylogarithmic the instance and witness sizes.  ...  However, we currently do not know of any construction of SNARGs with a formal proof of security under any simple cryptographic assumption.  ...  For example, we can take some arbitrary proof system and assume that it is zero knowledge.  ... 
doi:10.1145/1993636.1993651 dblp:conf/stoc/GentryW11 fatcat:7evdlxueozdk7ax3xnihgissxi

Simulatable Adaptive Oblivious Transfer [chapter]

Jan Camenisch, Gregory Neven, abhi shelat
2007 Lecture Notes in Computer Science  
We propose two practical protocols for this primitive that achieve a stronger security notion than previous schemes with comparable efficiency.  ...  practical schemes.  ...  a zero-knowledge proof).  ... 
doi:10.1007/978-3-540-72540-4_33 fatcat:oeuomhzoavbchlazx3cljg7c3i

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza
2015 2015 IEEE Symposium on Security and Privacy  
Non-interactive zero-knowledge proofs (NIZKs) are a powerful cryptographic tool, with numerous potential applications.  ...  Applications of our system include generating public parameters for systems such as Zerocash and the scalable zero-knowledge proof system of (Ben-Sasson et al.  ...  Non-interactive zero-knowledge proofs of knowledge A non-interactive zero-knowledge proof of knowledge (NIZK) for an NP relation R in the common random string model is a tuple NIZK R = (NIZK R .P, NIZK  ... 
doi:10.1109/sp.2015.25 dblp:conf/sp/Ben-SassonC0TV15 fatcat:lh2mmdyenjhexcmt3cytfwncfa


Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
(STOC 2007) to a variant of the protocol for secure multiparty computation of Damgård and Ishai (Crypto 2006).  ...  The following numbers apply either to interactive zero-knowledge protocols based on collision-resistant hash functions or to non-interactive zk-SNARKs in the random oracle model obtained via the Fiat-Shamir  ...  FROM ZKIPCP TO ZK In this section we describe variants of known transformations from (sublinear) zero-knowledge PCP to (sublinear) zero-knowledge argument.  ... 
doi:10.1145/3133956.3134104 dblp:conf/ccs/AmesHIV17 fatcat:fe7vy5gt3zhofpsckw65l6hiqi


Phan Duong Hieu, Moti Yung
2021 Journal of Computer Science and Cybernetics  
This may be the widest domain in the new era of modern technologies with cloud computing and big data, where users delegate the storage of their data and the computation to the cloud.  ...  However, when cryptographic protocols are deployed for emerging applications such as cloud services or big data, the demand for security grows beyond these basic requirements.  ...  While we know how to construct a zero-knowledge proof for any NP-relation [45] , such a zero-knowledge proof is very expensive as it acts on the whole set of ciphertexts.  ... 
doi:10.15625/1813-9663/37/4/16104 fatcat:o7mu4ht5uneadncuyouedgs7nq

Weak randomness seriously limits the security of quantum key distribution

Jan Bouda, Matej Pivoluska, Martin Plesch, Colin Wilmott
2012 Physical Review A. Atomic, Molecular, and Optical Physics  
In usual security proofs of quantum protocols the adversary (Eve) is expected to have full control over any quantum communication between any communicating parties (Alice and Bob).  ...  Such knowledge should always be expected in realistic experimental conditions via different side channels.  ...  Moreover, knowledge pertaining to the secret key held by the adversary will be comparable to the knowledge held by the receiving party.  ... 
doi:10.1103/physreva.86.062308 fatcat:l2o56usmnndyxgnmkzpslxekta

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan
2012 Proceedings of the 44th symposium on Theory of Computing - STOC '12  
We propose a new notion of secure multiparty computation aided by a computationallypowerful but untrusted "cloud" server.  ...  This extends the standard notion of fully homomorphic encryption (FHE), where users can only enlist the cloud's help in evaluating functions on their own encrypted data.  ...  Adding Zero-Knowledge Proofs.  ... 
doi:10.1145/2213977.2214086 dblp:conf/stoc/Lopez-AltTV12 fatcat:2jw2ee3e7zahpchnpfjet366km

Efficient Zero-Knowledge Proof Systems [chapter]

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth
2016 Lecture Notes in Computer Science  
In these lecture notes we give an overview of some central techniques behind the construction of efficient zero-knowledge proofs.  ...  A particular type of proof systems are zero-knowledge proof systems, where the prover convinces the verifier that the statement is true but does not leak any other information.  ...  Security properties. Completeness, soundness and zero-knowledge often come in one of three flavours: perfect, statistical and computational.  ... 
doi:10.1007/978-3-319-43005-8_1 fatcat:d7efu3p5mje2bh3cevr7wpgvym

SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search [article]

Hao Chen and Ilaria Chillotti and Yihe Dong and Oxana Poburinnaya and Ilya Razenshteyn and M. Sadegh Riazi
2020 arXiv   pre-print
We provide several contributions to each of these primitives which are applicable to other secure computation tasks.  ...  SANNS comprises two protocols: an optimized linear scan and a protocol based on a novel sublinear time clustering-based algorithm.  ...  Related Work To the best of our knowledge, all prior work on the secure k-NNS problem in the secure two-party computation setting is based on the linear scan, where we first compute the distance between  ... 
arXiv:1904.02033v5 fatcat:pvcw27sbqngfjekaygamwefjue

Secure Anonymous Broadcast [article]

Mahnush Movahedi and Jared Saia and Mahdi Zamani
2014 arXiv   pre-print
This problem is increasingly important as a black-box in many privacy-preserving applications such as anonymous communication, distributed auctions, and multi-party computation.  ...  Our protocol is provably secure against traffic analysis, does not require any trusted party, and is completely load-balanced.  ...  To the best of our knowledge, every sender and receiver anonymous broadcast protocol that does not rely on a trusted party consists of at least three steps. 1.  ... 
arXiv:1405.5326v1 fatcat:22npksye7vaqlg72ipshrmc2eu
« Previous Showing results 1 — 15 out of 243 results