Filters








77,206 Hits in 5.0 sec

Games and the Impossibility of Realizable Ideal Functionality [chapter]

Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
<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;
We relate ideal functionalities to games by defining the set of ideal functionalities associated with a game condition and show that under this definition, which reflects accepted use and known examples  ...  , bit commitment, a form of group signatures, and some other cryptographic concepts do not have any realizable ideal functionality.  ...  Intuitively, the functionality G together with protocol P constitutes an ideal functionality for bit-commitment F , and any realization of G will lead to the realization of F .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11681878_19">doi:10.1007/11681878_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/43mhenuiunfplelntydmlj3gq4">fatcat:43mhenuiunfplelntydmlj3gq4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503104801/https://link.springer.com/content/pdf/10.1007%2F11681878_19.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/d3/ea/d3ea92ad5ed81b53875c3adb001b39beeb5397bf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11681878_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Does collective rationality entail efficiency?

P. Weirich
<span title="2009-12-14">2009</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mwzmwwmscfe4vnzrjlt5itd2ju" style="color: black;">Logic Journal of the IGPL</a> </i> &nbsp;
However, the essay relies mainly on principles of rationality governing pursuit of goals, such as the principle to maximize expected utility, which addresses cases where probability and utility functions  ...  They know enough about their game and each other to have foreknowledge of their joint action. Strengthening the idealizations for cooperative games this way nonetheless fails to ensure efficiency.  ...  Preparation for a game changes not the game's value function but its concrete realization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/jigpal/jzp064">doi:10.1093/jigpal/jzp064</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q52mlxd73nfjdbkh6ifxnyb46i">fatcat:q52mlxd73nfjdbkh6ifxnyb46i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227172226/http://pdfs.semanticscholar.org/7eb2/8097e587baccc51ded0c8b765fa69627a79a.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/7e/b2/7eb28097e587baccc51ded0c8b765fa69627a79a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/jigpal/jzp064"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Everlasting Multi-party Computation [chapter]

Dominique Unruh
<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 define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature  ...  This models the fact that we cannot predict which cryptographic schemes will be broken, say, several decades after the protocol execution.  ...  European Social Fund's Doctoral Studies and Internationalisation Programme DoRa, by the European Regional Development Fund through the Estonian Center of Excellence in Computer Science, EXCS.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40084-1_22">doi:10.1007/978-3-642-40084-1_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4o7uneh3mnh7bn5zva3oafvzjm">fatcat:4o7uneh3mnh7bn5zva3oafvzjm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151022142307/http://eprint.iacr.org/2012/177.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/d2/7b/d27bc774104deb92992d21613397f699bcbdc1ea.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-40084-1_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Everlasting Multi-party Computation

Dominique Unruh
<span title="2018-03-06">2018</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;
We define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature  ...  This models the fact that we cannot predict which cryptographic schemes will be broken, say, several decades after the protocol execution.  ...  Acknowledgements This work was funded by institutional research grant IUT2-1 from the Estonian Research Council, and by European Regional Development Fund and the Estonian ICT  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-018-9278-z">doi:10.1007/s00145-018-9278-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zlbmu25wanf5rhfps26avdlcta">fatcat:zlbmu25wanf5rhfps26avdlcta</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503142409/https://link.springer.com/content/pdf/10.1007%2Fs00145-018-9278-z.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/40/ba/40bab4690d295af58b55881b09d73b794b5b4995.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-018-9278-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Framework for the Sound Specification of Cryptographic Tasks

Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kea5jpvemrdmvbwvgh5jn6gog4" style="color: black;">2010 23rd IEEE Computer Security Foundations Symposium</a> </i> &nbsp;
Effectively, this puts forth a bottom-up approach for the specification of ideal functionalities: first one defines a set of basic constituent functionalities for the task at hand, and then combines them  ...  into a single ideal functionality taking advantage of the algebraic structure.  ...  Specifically, we prove that it is possible to draw a realizability horizon at some level of the semilattice of canonical functionalities that separates realizable functionalities from those that are impossible  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/csf.2010.26">doi:10.1109/csf.2010.26</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/csfw/GarayKZ10.html">dblp:conf/csfw/GarayKZ10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h7ouv3t7hvdhjibstwjo6hqjby">fatcat:h7ouv3t7hvdhjibstwjo6hqjby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120508173702/http://eprint.iacr.org/2008/132.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/92/38/9238b73b64aeff6ddc4bc0163f12fc4c0c7f833b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/csf.2010.26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Security Limitations of Classical-Client Delegated Quantum Computing [article]

Christian Badertscher, Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Dominik Leichtle, Atul Mantri, Petros Wallden
<span title="2020-07-03">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem.  ...  We first identify the goal of RSP_CC as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using RSP_CC.  ...  The authors thank Céline Chevalier, Omar Fawzi, Daniel Jost, and Luka Music for useful discussions. LC also thanks M.T. This work has been supported in part by  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.01668v1">arXiv:2007.01668v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2gb5qmsqt5fn5mfwak4aotxe2u">fatcat:2gb5qmsqt5fn5mfwak4aotxe2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200722050611/https://arxiv.org/pdf/2007.01668v1.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/63/90/6390ae14452179fa21bb8f145d228c0634beb1e2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.01668v1" 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>

Rational Protocol Design: Cryptography against Incentive-Driven Adversaries

Juan Garay, Jonathan Katz, Ueli Maurer, Bjorn Tackmann, Vassilis Zikas
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v4uclqixrrhlnk5pbw4wii6cfq" style="color: black;">2013 IEEE 54th Annual Symposium on Foundations of Computer Science</a> </i> &nbsp;
Specifically, we consider a two-party game between an protocol designer and an external attacker.  ...  Finally, we investigate the problem of secure function evaluation in our framework, where the attacker has to pay for each party it corrupts.  ...  A protocol is "secure" if it realizes the ideal specification of the task against any adversarial strategy.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2013.75">doi:10.1109/focs.2013.75</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/focs/GarayKMTZ13.html">dblp:conf/focs/GarayKMTZ13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x5kjoic45ndqlad5jf3qnqospq">fatcat:x5kjoic45ndqlad5jf3qnqospq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160309191000/http://eprint.iacr.org/2013/496.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/a5/e2/a5e281c40753e250c42ae1d2daaa90b5b4e43224.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2013.75"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Feasibility and Completeness of Cryptographic Tasks in the Quantum World [chapter]

Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas
<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;
With this in mind, we study the feasibility of realizing functionalities in the framework of universal composability, with respect to both computational and informationtheoretic security.  ...  The same holds with regard to functionalities that are complete (i.e., can be used to realize arbitrary other functionalities).  ...  Then K = F (X) satisfies D(ρ KF E , 1 2 I K ⊗ ρ F E ) ≤ 1 2 · 2 − 1 E Impossibility of Quantum UC Commitment Canetti and Fischlin [CF01] show the impossibility of realizing F COM in the plain model  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36594-2_16">doi:10.1007/978-3-642-36594-2_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iycjx6b5lzabzhgukkdpepxvxq">fatcat:iycjx6b5lzabzhgukkdpepxvxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922021150/https://homepages.cwi.nl/~fehr/mypapers/FKSZZ13.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/6a/5e/6a5e55b9b17f18dd4fb8e0b1ac7c74a4df024e68.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-36594-2_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model [chapter]

Eike Kiltz, Krzysztof Pietrzak
<span title="">2009</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;
Our main result is a black-box impossibility result showing that one cannot prove any such padding-based scheme chosen-ciphertext secure even assuming the existence of ideal trapdoor permutations.  ...  The latter is a strong ideal abstraction of trapdoor permutations which inherits all security properties of uniform random permutations.  ...  to an oracle realizing a uniformly random function), whereas an ideal TDP is defined by its security properties.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-01001-9_23">doi:10.1007/978-3-642-01001-9_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zlsar2dlvbftbih7be5tpjbnuq">fatcat:zlsar2dlvbftbih7be5tpjbnuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809034619/http://homepage.ruhr-uni-bochum.de/Eike.Kiltz/papers/KilPie09.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/e6/4b/e64bfd07f1c5d7d84bfd6c37164a1201b2f806d2.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-01001-9_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Games and the Future of Man. Gamification as a Transhumanist Program

Kamil Kleszczyński
<span title="">2019</span> <i title="International Society of Philosophy and Cosmology"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jj73wvzpb5c4porgrlzdqvlyrq" style="color: black;">Future Human Image</a> </i> &nbsp;
It is possible to indicate three main areas of the realization of this function of gamification.  ...  The first one is progressive virtualization, resulting in the disappearance of reality and multiplication of man's ways of existence. Gamification teaches how to function in these conditions.  ...  Its basic function, i.e. the melting of play and work, breaks an important boundary. Virtual game, which was used to train skills realized later in reality, was a simulation of "real" activities.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.29202/fhi/12/4">doi:10.29202/fhi/12/4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cvis2zmwvjhqplyaw4intmshyq">fatcat:cvis2zmwvjhqplyaw4intmshyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191208152705/http://www.fhijournal.org/wp-content/uploads/2019/12/FHI_12_Kleszczy_ski.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/ef/62ef5b64fb3e544d17a486ab1ecf2a44f82b120d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.29202/fhi/12/4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Page 318 of The Elementary School Journal Vol. 5, Issue 5 [page]

<span title="">1905</span> <i title="University of Chicago, acting through its Press"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_elementary-school-journal" style="color: black;">The Elementary School Journal </a> </i> &nbsp;
There never was an ideal realized that was not at one stage of the game stamped “utopian.”  ...  practical way offer a new force to stem the tide of concentration in cities by offering interests and control in country pursuits; to refute the doctrine that these ideals are impossible of realization  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_elementary-school-journal_1905-01_5_5/page/318" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_elementary-school-journal_1905-01_5_5/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer [chapter]

Shota Goto, Junji Shikata
<span title="">2015</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;
In order to discuss the composability of game-theoretic properties, we study security of cryptographic protocols in terms of the universal composability (UC) and game theory simultaneously.  ...  we obtain a construction of OT meeting both UC security and game-theoreticsecurity.  ...  This work was partially supported by JSPS KAKENHI Grant Number 15H02710, and it was partially conducted under the auspices of the MEXT Program for Promoting the Reform of National Universities.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-27239-9_8">doi:10.1007/978-3-319-27239-9_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xdj34aqm4nh7nohlowpm5iyoou">fatcat:xdj34aqm4nh7nohlowpm5iyoou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160309220653/http://eprint.iacr.org/2015/950.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/1b/e2/1be2604714cac6e22a1e6170d632db15bd3a4637.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-27239-9_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes [chapter]

Michael Backes, Birgit Pfitzmann, Michael Waidner
<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;
We show that it is impossible to extend the strong BRSIM/UC results to usual Dolev-Yao models of hash functions in the general case.  ...  For the standard model of cryptography, we also discuss several conceivable restrictions and extensions to the Dolev-Yao models and classify them into possible and impossible cases in the strong BRSIM/  ...  We thank Martín Abadi, Anupam Datta, Ante Derek, Cathy Meadows, John Mitchell, and Andre Scedrov for interesting discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11863908_25">doi:10.1007/11863908_25</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vpcrow6o4nalxnxliydvhtgqvi">fatcat:vpcrow6o4nalxnxliydvhtgqvi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200325203923/https://link.springer.com/content/pdf/10.1007%2F11863908_25.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/79/67/7967888f7da726a63ea92d53f581ca055c2cf415.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11863908_25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fair Distribution of Efficiency Gains in Supply Networks from a Cooperative Game Theory Point of View

Stephan Zelewski, Malte L Peters
<span title="">2010</span> <i title="IGI Global"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yqoztlitizfgrhkzn43cfvqrme" style="color: black;">International Journal of Information Systems and Supply Chain Management (IJISSCM)</a> </i> &nbsp;
game is that the values of the characteristic function c for all three types of coalitions are available.  ...  γ = 0 und γ = 1 can be chosen arbitrarily based on the coincidence of the ideal point and the threat point.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4018/jisscm.2010040101">doi:10.4018/jisscm.2010040101</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hrj2w4a7dzc7tpwnzgsfpzbdza">fatcat:hrj2w4a7dzc7tpwnzgsfpzbdza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813072535/https://www.econbiz.de/archiv1/2010/132392_distribution_efficiency_networks.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/74/6a/746a2d99655eb16ad758b696c29d7227f423e629.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4018/jisscm.2010040101"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Collusion-Preserving Computation [chapter]

Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas
<span title="">2012</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;
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate "any information beyond what the protocol allows".  ...  Next we provide a general feasibility result v for collusion-preserving computation of arbitrary functionalities.  ...  More precisely, the CP framework implicitly realizes the definition of isomorphisms using functions f and g that are defined via 2 sets of ITMs (including all ITMs of parties and available ideal functionalities  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32009-5_9">doi:10.1007/978-3-642-32009-5_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/25h2cbfo3jfsnmkypp7zck4qtu">fatcat:25h2cbfo3jfsnmkypp7zck4qtu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830045818/https://cs.nyu.edu/media/publications/joel_alwen.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/aa/46/aa46a86b645685828bbd9c55970117473d680060.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-32009-5_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 77,206 results