Filters








18,689 Hits in 6.1 sec

On the Exact Round Complexity of Self-composable Two-Party Computation [chapter]

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey
2017 Lecture Notes in Computer Science  
We focus on the two party case and present a new secure computation protocol that achieves SPS security under concurrent self-composition.  ...  In this work, we take the first steps towards studying the exact round complexity of concurrent secure computation.  ...  The argument for this statement is similar to the one in the proof of Claim 4. By combining Claims 1 -9, we conclude that the two inequalities in the statement of Lemma 2 hold for k.  ... 
doi:10.1007/978-3-319-56614-6_7 fatcat:xyxs3fpt6bchnpm6lrcd43md6e

Private Multiparty Set Intersection Protocol in Rational Model

Keita Emura, Atsuko Miyaji, Mohammad Shahriar Rahman
2013 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications  
In our model, the parties are viewed as rational whereby they are assumed (only) to act in their self-interest. Our protocol satisfies computational Nash equilibrium.  ...  Protocols in malicious model guarantee strong security at the price of expensive computations like homomorphic encryption and zero-knowledge proof.  ...  The round complexity of the protocol for each item is O(α −1 ), where α is the geometric distribution used to pick up the value of i * (typically, we will need only two rounds for each items in our protocol  ... 
doi:10.1109/trustcom.2013.54 dblp:conf/trustcom/EmuraMR13 fatcat:y5bm72lytvdlvo3bsrg6x6mkqe

Computing on Anonymous Quantum Network [article]

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
2010 arXiv   pre-print
Another corollary is the first quantum algorithm that exactly computes any computable Boolean function with round complexity O(n) and with smaller bit complexity than that of existing classical algorithms  ...  A corollary of this result is a more efficient quantum leader election algorithm than existing ones: the new quantum algorithm runs in O(n) rounds with bit complexity O(mn^2), on an anonymous quantum network  ...  [18] work with some modifications even on directed networks, but they require rounds super-linear in the number of parties).  ... 
arXiv:1001.5307v1 fatcat:rps26qovzbdktdapw232nxldyy

Lower Bounds for Concurrent Self Composition [chapter]

Yehuda Lindell
2004 Lecture Notes in Computer Science  
We also prove a communication complexity lower bound on protocols that securely compute a large class of functionalities in this setting.  ...  In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties.  ...  Two-party computation. A two-party protocol problem is cast by specifying a random process that maps pairs of inputs to pairs of outputs (one for each party).  ... 
doi:10.1007/978-3-540-24638-1_12 fatcat:n5k3vligqzdvhf5ogjf4bdsaua

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell
2007 Journal of Cryptology  
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties.  ...  We also prove a communication complexity lower bound on protocols that securely compute a large class of functionalities in this setting.  ...  Thanks also to Jonathan Katz for discussions regarding the feasibility of securely computing the zero-knowledge  ... 
doi:10.1007/s00145-007-9015-5 fatcat:clx76ielrvgv7b3yjj7xpqgz7e

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
2005 Journal of Cryptology  
In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted.  ...  a third or more of the parties are corrupted.  ...  Acknowledgements We would like to thank Oded Goldreich for many helpful discussions, and Juan Garay for pointing out the appropriate reference to [5] .  ... 
doi:10.1007/s00145-005-0319-z fatcat:i2narlrnsjahplxte6po2wo4by

Analysing Randomized Distributed Algorithms [chapter]

Gethin Norman
2004 Lecture Notes in Computer Science  
However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distributed computation.  ...  To prove a randomized distributed algorithm correct one usually involves two levels: classical, assertion-based reasoning, and a probabilistic analysis based on a suitable probability space on computations  ...  Then show that: (a) composing in parallel two copies of the abstraction behave like the abstraction and (b) the property of interest holds over the abstraction composed with the single process P 1 .  ... 
doi:10.1007/978-3-540-24611-4_11 fatcat:beepcl2jabdglhtgijk7frncvm

Self-adapting Applications Based on QA Requirements in the Cloud Using Market-Based Heuristics [chapter]

Vivek Nallur, Rami Bahsoon
2010 Lecture Notes in Computer Science  
We conclude with a discussion on evaluating this mechanism of self-adaptation, with regards to scalability in the cloud.  ...  We simulate agents trading webservices on behalf of self-managing applications and demonstrate that such a mechanism leads to a good allocation of web-services to applications, even when applications dynamically  ...  This allows it to scale up and scale down the number of computational nodes, depending on the size of the job.  ... 
doi:10.1007/978-3-642-17694-4_5 fatcat:y5gjmvog3ve57etjxm4e77oo3q

Distributed Computing Column 60

Jennifer L. Welch
2015 ACM SIGACT News  
Carmit concluded the talk by pointing out two open problems: constant round two-party computation with partial erasures and extension to multi-party computation.  ...  Björn also presented a two-party protocol that achieves the optimal fairness for computing any given function. The result can be extended to multi-party computation of non-reactive functions.  ... 
doi:10.1145/2852040.2852055 fatcat:hlayo67wurfjhexvgbejt4cwdm

Privacy-Aware Processing of Biometric Templates by Means of Secure Two-Party Computation [chapter]

Riccardo Lazzeretti, Pierluigi Failla, Mauro Barni
2013 Security and Privacy in Biometrics  
This chapter focuses on the latter, presenting an innovative approach that, by relying on tools borrowed from Secure Two Party Computation (STPC) theory, permits to process the biometric data in encrypted  ...  Some general guidelines to be used in the design of a privacy-aware biometric system are given, so to allow the reader to choose the most appropriate tools depending on the application at hand.  ...  Since S needs to compute the XOR function, C computes two decryptions and one encryption and the complexity is 4 expo + 2 dec + 1 enc 7 expo. Client C Server S x r x D (.)  ... 
doi:10.1007/978-1-4471-5230-9_7 fatcat:uivjbqnp3bdmbcxwt2jss5dasi

Do Exact Calculation and Computation Estimation Reflect the Same Skills? Developmental and Individual Differences Perspectives

Dana Ganor-Stern
2018 Frontiers in Psychology  
Groups of children in 4th, 5th, and 6th grades and college students performed exact calculation and computation estimation tasks with two-digit multiplication problems.  ...  Finally, low correlation was found between the accuracy of the two tasks. Together, these findings suggest that exact calculation and computation estimation reflect at least in part different skills.  ...  ACKNOWLEDGMENTS The author thanks Korin Avital, VeredMalki, Lital Danino, and Avital Moshinski for their help in data collection and analysis, and for the participants who took part in this study.  ... 
doi:10.3389/fpsyg.2018.01316 pmid:30100893 pmcid:PMC6073251 fatcat:c27qeu3fy5gmfmzpviwkvjpeaq

On Expected Constant-Round Protocols for Byzantine Agreement [chapter]

Jonathan Katz, Chiu-Yuen Koo
2006 Lecture Notes in Computer Science  
Combined with existing results, this gives the first expected constant-round protocol for secure computation with honest majority in a point-to-point network assuming only one-way functions and a PKI.  ...  Here, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only on the existence of a secure signature scheme and a public-key  ...  C Exact Round Complexities In this section, we compute the exact round complexities of our broadcast/Byzantine agreement protocols, applying in the process some optimizations.  ... 
doi:10.1007/11818175_27 fatcat:vfi2lflcsfaw7fo34voqljgkvi

Trading Complex Assets

Bruce I. Carlin, Shimon Kogan, Richard Lowery
2012 Social Science Research Network  
We perform an experimental study of complexity to assess its effect on trading behavior, price volatility, liquidity, and trade efficiency.  ...  Subjects were asked to deduce the value of a particular asset from information they were given about the composition and price of several portfolios.  ...  They each participated in fifteen distinct periods, each of which was composed of two stages.  ... 
doi:10.2139/ssrn.1961671 fatcat:n5lsfxkzhfhzhi4dmqg6po25em

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

Vipul Goyal, Abhishek Jain
2013 Lecture Notes in Computer Science  
We in fact prove a more general theorem which allows for trade-off between round complexity and the number of ideal queries per session. We obtain our negative results in the following two steps: 1.  ...  There exists a two-party functionality that cannot be securely realized in the MIQ model by any constant round protocol, with any polynomial number of ideal queries per session.  ...  Recall that in order to prove security of a two-party computation protocol, we need to demonstrate that for every real world adversary A that controls one of the parties, there exists an ideal world adversary  ... 
doi:10.1007/978-3-642-38348-9_40 fatcat:jpws2xlss5euhao7vceplqqs6y

On expected constant-round protocols for Byzantine agreement

Jonathan Katz, Chiu-Yuen Koo
2009 Journal of computer and system sciences (Print)  
on the existence of signature schemes and a publickey infrastructure.  ...  In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t < n/3 malicious parties and runs in expected constant rounds.  ...  Acknowledgments We thank the anonymous reviewers for several helpful comments.  ... 
doi:10.1016/j.jcss.2008.08.001 fatcat:3b3taekqkjgs3elnj2xf5fbhiu
« Previous Showing results 1 — 15 out of 18,689 results