Filters








18,689 Hits in 8.0 sec

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

Sanjam Garg, Susumu Kiyoshima, Omkant Pandey
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-56614-6_7">doi:10.1007/978-3-319-56614-6_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xyxs3fpt6bchnpm6lrcd43md6e">fatcat:xyxs3fpt6bchnpm6lrcd43md6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170601021548/http://eprint.iacr.org/2017/124.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/89/3e89f899804e1055372bccc8cb992a97aabbf0f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-56614-6_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Private Multiparty Set Intersection Protocol in Rational Model

Keita Emura, Atsuko Miyaji, Mohammad Shahriar Rahman
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yaqmt4o5gzav5ivi6pnbkjqdui" style="color: black;">2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications</a> </i> &nbsp;
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  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/trustcom.2013.54">doi:10.1109/trustcom.2013.54</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/trustcom/EmuraMR13.html">dblp:conf/trustcom/EmuraMR13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y5bm72lytvdlvo3bsrg6x6mkqe">fatcat:y5bm72lytvdlvo3bsrg6x6mkqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830065207/http://isyou.info/jisis/vol2/no12/jisis-2012-vol2-no12-06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/32/02/32026610c50b5ae3ee1838fc25b3fe170ad414d7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/trustcom.2013.54"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Computing on Anonymous Quantum Network [article]

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
<span title="2010-01-29">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1001.5307v1">arXiv:1001.5307v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rps26qovzbdktdapw232nxldyy">fatcat:rps26qovzbdktdapw232nxldyy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1001.5307/1001.5307.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ff/7d/ff7d0c94526ea70dce9d05e884a3842a86de673e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1001.5307v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Lower Bounds for Concurrent Self Composition [chapter]

Yehuda Lindell
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24638-1_12">doi:10.1007/978-3-540-24638-1_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n5k3vligqzdvhf5ogjf4bdsaua">fatcat:n5k3vligqzdvhf5ogjf4bdsaua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170820131210/https://link.springer.com/content/pdf/10.1007%2F978-3-540-24638-1_12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/d2/34d222b3d6d7c7d96e487673d2bb155d42094c58.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24638-1_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Lower Bounds and Impossibility Results for Concurrent Self Composition

Yehuda Lindell
<span title="2007-09-28">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
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  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-007-9015-5">doi:10.1007/s00145-007-9015-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/clx76ielrvgv7b3yjj7xpqgz7e">fatcat:clx76ielrvgv7b3yjj7xpqgz7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130627084243/http://eprint.iacr.org/2004/045.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/e0/2ae08343b194eae4dbb4c152f0797221f171e477.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-007-9015-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
<span title="2005-05-20">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
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] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z">doi:10.1007/s00145-005-0319-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i2narlrnsjahplxte6po2wo4by">fatcat:i2narlrnsjahplxte6po2wo4by</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417163751/http://eprint.iacr.org/2002/040.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/24/84/2484330f40e318036d81c63974b5c28fe9c31f99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Analysing Randomized Distributed Algorithms [chapter]

Gethin Norman
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24611-4_11">doi:10.1007/978-3-540-24611-4_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/beepcl2jabdglhtgijk7frncvm">fatcat:beepcl2jabdglhtgijk7frncvm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031211046/http://qav.comlab.ox.ac.uk/papers/voss_rando.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/11/7a/117aa6e5a6a4e35c7082e392c5e56a74b06916b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24611-4_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

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

Vivek Nallur, Rami Bahsoon
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-17694-4_5">doi:10.1007/978-3-642-17694-4_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y5gjmvog3ve57etjxm4e77oo3q">fatcat:y5gjmvog3ve57etjxm4e77oo3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829124823/http://eprints.bham.ac.uk/618/5/NallurBahsoon_servicewave2010.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/1d/ef1d1a39727aef20bf7fe8db7747c270b919bc82.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-17694-4_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Distributed Computing Column 60

Jennifer L. Welch
<span title="2015-12-01">2015</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vl3iv5wfbneltjzmeof4n5xqca" style="color: black;">ACM SIGACT News</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2852040.2852055">doi:10.1145/2852040.2852055</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hlayo67wurfjhexvgbejt4cwdm">fatcat:hlayo67wurfjhexvgbejt4cwdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160310192317/https://parasol.tamu.edu/~welch/sigactNews/DC-col60-Dec15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/e2/f6e2eeeca6eb45dfd1f2c0455f269a36a55bb047.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2852040.2852055"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

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

Riccardo Lazzeretti, Pierluigi Failla, Mauro Barni
<span title="">2013</span> <i title="Springer London"> Security and Privacy in Biometrics </i> &nbsp;
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 (.)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4471-5230-9_7">doi:10.1007/978-1-4471-5230-9_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uivjbqnp3bdmbcxwt2jss5dasi">fatcat:uivjbqnp3bdmbcxwt2jss5dasi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310084427/https://iris.uniroma1.it/retrieve/handle/11573/967183/751894/Lazzeretti_Postprint_Privacy-Aware_2013.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/e9/c1e93c15357871f7e7f31d86d206e3707d5bf2f2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4471-5230-9_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

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

Dana Ganor-Stern
<span title="2018-07-27">2018</span> <i title="Frontiers Media SA"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5r5ojcju2repjbmmjeu5oyawti" style="color: black;">Frontiers in Psychology</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fpsyg.2018.01316">doi:10.3389/fpsyg.2018.01316</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30100893">pmid:30100893</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6073251/">pmcid:PMC6073251</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c27qeu3fy5gmfmzpviwkvjpeaq">fatcat:c27qeu3fy5gmfmzpviwkvjpeaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303192042/http://pdfs.semanticscholar.org/b1ef/b1f1abf4278d518245a9c87bd428f93a0423.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/ef/b1efb1f1abf4278d518245a9c87bd428f93a0423.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fpsyg.2018.01316"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> frontiersin.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6073251" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

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

Jonathan Katz, Chiu-Yuen Koo
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11818175_27">doi:10.1007/11818175_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vfi2lflcsfaw7fo34voqljgkvi">fatcat:vfi2lflcsfaw7fo34voqljgkvi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061207143813/http://eprint.iacr.org:80/2006/065.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/62/4f/624fae9921dd0a9c81234a1d22550170d4939e20.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11818175_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Trading Complex Assets

Bruce I. Carlin, Shimon Kogan, Richard Lowery
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tol7woxlqjeg5bmzadeg6qrg3e" style="color: black;">Social Science Research Network</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.1961671">doi:10.2139/ssrn.1961671</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n5lsfxkzhfhzhi4dmqg6po25em">fatcat:n5lsfxkzhfhzhi4dmqg6po25em</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321092920/http://www.thomasmoeller.net/thomasmoeller/Lone_Star_program_files/ut_paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ae/fa/aefae60b574b444b4e8340845095fc56d0aad320.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2139/ssrn.1961671"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ssrn.com </button> </a>

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

Vipul Goyal, Abhishek Jain
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
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  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-38348-9_40">doi:10.1007/978-3-642-38348-9_40</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jpws2xlss5euhao7vceplqqs6y">fatcat:jpws2xlss5euhao7vceplqqs6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727024900/https://link.springer.com/content/pdf/10.1007%2F978-3-642-38348-9_40.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8f/c1/8fc1cd87c5647652d7fc3d570520de5434751114.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-38348-9_40"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On expected constant-round protocols for Byzantine agreement

Jonathan Katz, Chiu-Yuen Koo
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
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.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jcss.2008.08.001">doi:10.1016/j.jcss.2008.08.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3b3taekqkjgs3elnj2xf5fbhiu">fatcat:3b3taekqkjgs3elnj2xf5fbhiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929145915/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/7cb/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAyMjAwMDAwODAwMDcxOA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/af/e8/afe8826f150118ffcc09580cf94d3b2fbe4f5ac0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jcss.2008.08.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 18,689 results