22,684 Hits in 6.4 sec

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

Susumu Kiyoshima
2015 Lecture Notes in Computer Science  
Non-black-box simulation in the concurrent setting.  ...  An important property of our simulation technique is that the simulator runs in a straight-line manner in the fully concurrent setting.  ...  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

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).  ...  There has been a long line of works on developing simulation strategies based on rewinding that would work in the fully concurrent setting [RK99, KP01, PRS02, DGS09].  ...  Thanks to the nice staff at Cafe Coffee Day, Lavelle Road where much of this research was carried out. Thanks to Divya Gupta for useful comments on many parts of the paper.  ... 
doi:10.1145/2488608.2488637 dblp:conf/stoc/Goyal13 fatcat:qi4ifx56k5b3xmkg7mevakajoq

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

Ran Canetti, Huijia Lin, Omer Paneth
2013 Lecture Notes in Computer Science  
We also show that the impossibility of black-box public-coin cZK extends also to the GHF model.  ...  Our techniques combine those for (non-public-coin) blackbox cZK with Barak's non-black-box technique for public-coin constantround ZK.  ...  Our construction can be viewed as "upgrading" the existing non-black-box simulation techniques to be fully concurrent, using the recursive the rewinding strategies from black-box cZK while remaining public-coin  ... 
doi:10.1007/978-3-642-36594-2_5 fatcat:lxo4iatujna4pbda7op2tueq4e

Improved Black-Box Constructions of Composable Secure Computation

Rohit Chatterjee, Xiao Liang, Omkant Pandey, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
In this notion, both the simulator and the adversary are given access to an oracle called an angel that can perform some predefined super-polynomial time task.  ...  We close the gap between black-box and non-black-box constructions of composable secure multiparty computation in the plain model under the minimal assumption of semi-honest oblivious transfer.  ...  Our Black-Box CCA Commitment Our starting point is to determine how we can make our protocol (in Figure 2 ) fully black-box.  ... 
doi:10.4230/lipics.icalp.2020.28 dblp:conf/icalp/ChatterjeeLP20 fatcat:ykhluttpwvhmrkephnowl3fq4a

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.  ...  The authorization levels are encoded in the non-local resources distributed to the users, and subsequently confirmed by their ability to win CHSH games using such resources.  ...  Device-independence by self-testing via simulation [22, 23] : An alternative approach to proving deviceindependence by self-testing is via simulation.  ... 
doi:10.1103/physreva.103.022430 fatcat:rwcrzkfx7ncypfbtyfew6kd2pi

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

David Xiao
2011 Lecture Notes in Computer Science  
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel (or concurrently) and an adversary can choose depending on the commit-phase transcript to see  ...  (EUROCRYPT '09), and are proved in a fundamentally different way, by observing that essentially all known impossibility results for black-box zero-knowledge can also be applied to the case of commitments  ...  crypto primitive itself in a non-black-box way.  ... 
doi:10.1007/978-3-642-19571-6_33 fatcat:3ary7bor3zh5paq6lxqrgvh65a

Concurrent Nonmalleable Commitments

Rafael Pass, Alon Rosen
2008 SIAM journal on computing (Print)  
Our result is achieved without assuming an a-priori bound on the number of executions and without relying on any set-up assumptions.  ...  That is, a manin-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver, cannot make the values he commits to  ...  We are grateful to Silvio Micali for many helpful discussions and encouragement.  ... 
doi:10.1137/060661880 fatcat:vjvb5tuzafdgnnhnbbvzcogcga

Integrated Conceptual Mechatronic Design of a Delta Robot

Rogelio de Jesús Portillo-Vélez, Iván Andrés Burgos-Castro, José Alejandro Vásquez-Santacruz, Luis Felipe Marín-Urías
2022 Machines  
A fully integrated conceptual design, clarifying the recurrence of the conceptual design process using black-box/white-box analysis, is presented using the Model Based Systems Engineering (MBSE) paradigm  ...  Multiple designs proposals are then evaluated by the non-linear Choquet integral in order to choose the most appropriate according to a multicriteria requirement.  ...  , in consistency with the set of final requirements determined in the black-box analysis shown in Figure 6 .  ... 
doi:10.3390/machines10030186 fatcat:opihggzaivd2nb47cpih7eln6u

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

Vipul Goyal, Divya Gupta, Amit Sahai
2015 Lecture Notes in Computer Science  
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  ...  Recently, Goyal (STOC'13) proposed a new non-black-box simulation techniques for fully concurrent zero knowledge with straight-line simulation.  ...  Positive results for concurrently secure computation in the plain model. In FOCS, pages 41-50, 2012. [Goy13] Vipul Goyal. Non-black-box simulation in the fully concurrent setting.  ... 
doi:10.1007/978-3-662-48000-7_2 fatcat:qax4zko7pjh6llyimc7b4cnajq

Self-tuning in Distributed Transactional Memory [chapter]

Maria Couceiro, Diego Didona, Luís Rodrigues, Paolo Romano
2015 Lecture Notes in Computer Science  
This chapter surveys existing research in the area of autonomic DTM design, with a focus on the approaches aimed at answering the following two fundamental questions: how many resources (number of nodes  ...  In fact, the performance of these mechanisms is affected by a number of intertwined factors that make it hard, or even impossible, to statically configure a DTM platform for optimal performance.  ...  when compared with pure black-box approaches. • Bootstrapping: this methodology relies on an AM predictor to generate an initial synthetic training set for the ML, with the purpose of avoiding the initial  ... 
doi:10.1007/978-3-319-14720-8_19 fatcat:gwngrc57snd3ddzfanppruu5am

Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP [chapter]

Omkant Pandey, Manoj Prabhakaran, Amit Sahai
2015 Lecture Notes in Computer Science  
It shows, for the first time, that in the realm of non-black-box simulation, concurrent zero-knowledge may not necessarily require more rounds than stand alone zero-knowledge! *  ...  Our reduction relies on a new non-black-box simulation technique which does not use the PCP theorem.  ...  21 We also note that this is in fact identical to first choosing i randomly (to be used in the last step to set up τi) and then choosing (uniquely defined) i ∈ {1, 2} \ i (or equivalently i = i ) for  ... 
doi:10.1007/978-3-662-46497-7_25 fatcat:md4vfj242nbnzmhrnezhblfeai

Constant-Round Concurrent Zero Knowledge from P-Certificates

Kai-Min Chung, Huijia Lin, Rafael Pass
2013 2013 IEEE 54th Annual Symposium on Foundations of Computer Science  
languages, with "black-box" simulators, require at leastΩ(log n) number of communication rounds.  ...  More recent work by Prabhakaran, Rosen and Sahai [PRS02] improves the analysis of the KP simulator, achieving an essentially optimal, w.r.t. black-box simulation, round-complexity ofÕ(log n); see also  ...  in the paper, several obstacles to using non-black-box simulation to obtain constant-round concurrent zero-knowledge were noticed in an unpublished manuscript with Alon dating back to 2003 [PR03a] .  ... 
doi:10.1109/focs.2013.14 dblp:conf/focs/ChungLP13 fatcat:wdkggfvz75d7vb3xl77dspcfmy

A novel approach to public-coin concurrent zero-knowledge and applications on resettable security

Zhenbin Yan, Yi Deng
2019 Science China Information Sciences  
The key technique involves a new variant of Barak's non-black-box simulate approach.  ...  In this paper, we further address this problem and present an alternative construction of public-coin CZK argument system with succinct slot.  ...  In the public-coin fully concurrent setting, Canetti et al.  ... 
doi:10.1007/s11432-018-9627-x fatcat:nl637h4gjzbytg6mcnm6bm7jnq

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell
2007 Journal of Cryptology  
The above results are unconditional and hold for any type of simulation (i.e., even for non-black-box simulation).  ...  In addition, we prove a severe lower bound on protocols that are proven secure using black-box simulation.  ...  Acknowledgements I would like to express deep thanks to Ran Canetti for his help in this work. 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

On Classical Cryptographic Protocols in Post-Quantum World

István Vajda
2017 International Journal of Computer Network and Information Security  
In post-quantum approach, we consider classical (non-quantum) protocols and primitives which are run by honest parties on classical computers and our aim is to keep their security in an environment where  ...  In particular, even a harder goal is set by requiring provable security guaranties in a concurrent running environment as we aim computational UC-security.  ...  We assume, as usual, that the ideal system adversary (simulator) carries out black box simulation.  ... 
doi:10.5815/ijcnis.2017.08.01 fatcat:pje7deeesvfhzhopt3dm5o7jhq
« Previous Showing results 1 — 15 out of 22,684 results