Filters








10,362 Hits in 2.1 sec

Concurrent Secure Computation via Non-Black Box Simulation [chapter]

Vipul Goyal, Divya Gupta, Amit Sahai
2015 Lecture Notes in Computer Science  
The goal of this paper is to study what can be achieved in the setting of concurrent secure computation using non-black-box simulation techniques, building upon the work of Goyal.  ...  This gives us a quite natural example of a functionality in concurrent setting which is impossible to realize using black-box simulation but can be securely realized using non-black-box simulation. • Moreover  ...  Lindell [Lin08] showed that any protocol that computes the blind signature in the plain model and remains secure for m concurrent executions, where security is proven via black-box simulation, must have  ... 
doi:10.1007/978-3-662-48000-7_2 fatcat:qax4zko7pjh6llyimc7b4cnajq

On Concurrently Secure Computation in the Multiple Ideal Query Model [chapter]

Vipul Goyal, Abhishek Jain
2013 Lecture Notes in Computer Science  
Both of these results are unconditional and even rule out protocols proven secure using a non-black-box simulator.  ...  We first prove our results with respect to black-box simulation, i.e., we only rule out simulators that make black-box use of the adversary. 2.  ...  Thus, we conclude that the black-box simulator S, who is only allowed C queries, must fail. 2 From Black-Box to Non-Black-Box.  ... 
doi:10.1007/978-3-642-38348-9_40 fatcat:jpws2xlss5euhao7vceplqqs6y

Black-Box Constructions of Composable Protocols without Set-Up [chapter]

Huijia Lin, Rafael Pass
2012 Lecture Notes in Computer Science  
We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (without any set-up, and without assuming  ...  universal composition, and implies super-polynomial-time simulation security.  ...  As far as we know, this is the first black-box construction of secure multi-party computation protocols that achieve any non-trivial notion of concurrent security in the plain model (without any trusted-set  ... 
doi:10.1007/978-3-642-32009-5_27 fatcat:oygb33ub2zgydfeeyeytxlgj3a

(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks [chapter]

David Xiao
2011 Lecture Notes in Computer Science  
We prove the following black-box constructions and black-box lower bounds for commitments secure against selective opening attacks: 1.  ...  For concurrent composition, ω(log n) rounds are sufficient to build statistically binding commitments and are necessary even to build computationally binding and computationally hiding commitments, up  ...  SH) denote computational (resp. statistical) hiding. We give the following constructions: Theorem 1. The following hold via fully black-box reductions: 1.  ... 
doi:10.1007/978-3-642-19571-6_33 fatcat:3ary7bor3zh5paq6lxqrgvh65a

Information-theoretically secure protocols and security under composition

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2006 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06  
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent  ...  ., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs).  ...  a straight-line black-box simulator is secure under concurrent general composition.  ... 
doi:10.1145/1132516.1132532 dblp:conf/stoc/KushilevitzLR06 fatcat:yvuly6h5obbu3alwbxygt2gwqa

Information-Theoretically Secure Protocols and Security under Composition

Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
2010 SIAM journal on computing (Print)  
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent  ...  ., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs).  ...  a straight-line black-box simulator is secure under concurrent general composition.  ... 
doi:10.1137/090755886 fatcat:vqap7ivuizfapowlalyju5sdlm

Black-Box Constructions of Two-Party Protocols from One-Way Functions [chapter]

Rafael Pass, Hoeteck Wee
2009 Lecture Notes in Computer Science  
Non-black-box usage: A construction is non-black box if it uses the code computing the functionality of the primitive.  ...  We stress that the general question of whether we can securely realize tasks via black-box access to a general primitive is not merely of theoretical interest.  ...  By further applying the results in [15, 33] , we obtain a O(log n)-round non-malleable commitment and a O(n)-round concurrent nonmalleable commitment.  ... 
doi:10.1007/978-3-642-00457-5_24 fatcat:lbsvw7uyqnalfmzbajqu2lxki4

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model [chapter]

Ran Canetti, Huijia Lin, Omer Paneth
2013 Lecture Notes in Computer Science  
Our techniques combine those for (non-public-coin) blackbox cZK with Barak's non-black-box technique for public-coin constantround ZK.  ...  Furthermore, it is known that no such protocol can be black-box ZK [Pass et.al, We present a public-coin concurrent ZK protocol for any NP language.  ...  However, here we encounter yet another difference between black-box and non-black-box simulation.  ... 
doi:10.1007/978-3-642-36594-2_5 fatcat:lxo4iatujna4pbda7op2tueq4e

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell
2007 Journal of Cryptology  
Specifically, we show that any protocol that computes the blind signature or oblivious transfer functionalities and remains secure for m concurrent executions, where security is proven via black-box simulation  ...  Keywords: secure computation, protocol composition, self and general composition, impossibility results, lower bounds, non-black-box and black-box simulation. * This paper combines results that appeared  ...  Among other things, some key ideas in the proof of the black-box lower bound are due to Ran.  ... 
doi:10.1007/s00145-007-9015-5 fatcat:clx76ielrvgv7b3yjj7xpqgz7e

Round-Efficient Black-Box Construction of Composable Multi-Party Computation [chapter]

Susumu Kiyoshima
2014 Lecture Notes in Computer Science  
Practically, it is important because blackbox constructions are typically more efficient than non-black-box ones in terms of both communication complexity and computational complexity.  ...  In fact, since known non-black-box constructions of general MPC protocols compute general NP reductions to execute zero-knowledge proofs (this is where the codes of the primitives are used), they are highly  ...  .: Black-box, round-efficient secure computation via non-malleability amplification. In: FOCS, pp. 531-540 (2010) We have Pr [accept] ≥ Pr [cheat] from the definitions.)  ... 
doi:10.1007/978-3-662-44381-1_20 fatcat:qsz6bdhukrbsrb5pgfn3sd33pu

Device-independent quantum authorization based on the Clauser-Horne-Shimony-Holt game

Ricardo Faleiro, Manuel Goulão
2021 Physical Review A  
We formalize the protocol, prove its security, and frame it in the device-independent setting employing the notion of CHSH self-testing via simulation.  ...  In the spirit of device-independent cryptography, we present a two-party quantum authorization primitive with non-locality as its fueling resource.  ...  boxes is subsequently self-tested by the CHSH game/inequality via simulation.  ... 
doi:10.1103/physreva.103.022430 fatcat:rwcrzkfx7ncypfbtyfew6kd2pi

Page 1663 of Mathematical Reviews Vol. , Issue 2004b [page]

2004 Mathematical Reviews  
via black-box simulation.  ...  via black-box simulation, must use at least O(log) rounds of interaction.  ... 

Non-black-box simulation in the fully concurrent setting

Vipul Goyal
2013 Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13  
We present a new zero-knowledge argument protocol by relying on the non-black-box simulation technique of Barak (FOCS'01).  ...  A result by Pass, Tseng and Wikström [PTW11] shows that this is no coincidence: they show that only languages in BPP can have public-coin concurrent zero-knowledge proven secure using black-box simulation  ...  This also gives the first "natural" example of a functionality which is impossible to realize using black-box simulation but can be securely realized using non-black-box simulation in the concurrent setting  ... 
doi:10.1145/2488608.2488637 dblp:conf/stoc/Goyal13 fatcat:qi4ifx56k5b3xmkg7mevakajoq

An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting [chapter]

Susumu Kiyoshima
2015 Lecture Notes in Computer Science  
n/ log log n)round concurrent ZK protocols cannot be proven secure via black-box simulation [GK96, CKPR02].  ...  Traditionally, the security of all ZK protocols was proven via black-box simulation.  ...  Thus, studying more on non-black-box simulation and developing new non-black-box simulation techniques in the concurrent setting is still an important research direction.  ... 
doi:10.1007/978-3-662-46494-6_13 fatcat:amilq6ajrbhhtmowlb27r2jexe

A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models [chapter]

Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam
2017 Lecture Notes in Computer Science  
Our result is analogous to the unified framework of Lin, Pass, and Venkitasubramaniam [STOC'09, Asiacrypt'12] that, however, only yields non-black-box constructions of UC protocols.  ...  Using our framework, we improve black-box constructions in the common reference string and tamper-proof hardware token models by weakening the underlying computational and setup assumptions.  ...  For the task of achieving UC security with trusted setups, there still remain significant gaps between what is achievable via non-black-box and black-box constructions.  ... 
doi:10.1007/978-3-319-70500-2_26 fatcat:bytospaqiff4bmrujryrb66qry
« Previous Showing results 1 — 15 out of 10,362 results