Filters








1,135 Hits in 13.2 sec

Can Alice and Bob be random: a study on human playing zero knowledge protocols [article]

Kamil Kulesza
2007 arXiv   pre-print
It was during Advanced Course on Contemporary Cryptology that Di Crescenzo gave a course on zero knowledge protocols (ZKP), see [1].  ...  After that course we started to play with unorthodox ideas for breaking ZKP, especially one based on graph 3-coloring.  ...  Their applicability extend far beyond zero knowledge proof, with serious consequences to human computer interaction, especially in the field of security protocols.  ... 
arXiv:0708.3230v1 fatcat:opu45qihevfhbbmic7jvnozxxm

Communication with Imperfectly Shared Randomness [article]

Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2017 arXiv   pre-print
Along the way we also highlight some other basic problems such as compression, and agreement distillation, where shared randomness plays a central role and analyze the complexity of these problems in the  ...  This result builds on the intuition that communication with imperfectly shared randomness needs to be less sensitive to its random inputs than communication with perfectly shared randomness.  ...  We thank Badih Ghazi for pointing an error in a previous version of this paper and other discussions. We thank the anonymous referee for extensive comments and corrections.  ... 
arXiv:1411.3603v4 fatcat:gdzh5i7rf5bafp5bw6r3gdnj6i

The Power of Shared Randomness in Uncertain Communication [article]

Badih Ghazi, Madhu Sudan
2017 arXiv   pre-print
Can Alice and Bob achieve efficient communication amid uncertainty without using public randomness? How powerful are public-coin protocols in overcoming uncertainty?  ...  The pair (x,y) comes from a known distribution μ and f and g are guaranteed to be close under this distribution. Alice and Bob wish to compute g(x,y) with high probability.  ...  The authors would like to thank Ilan Komargodski, Pravesh Kothari and Mohsen Ghaffari and the anonymous reviewers for very helfpul discussions and pointers.  ... 
arXiv:1705.01082v1 fatcat:u2y5mx2ndfgjppj5tluyfzm66y

Communication with Imperfectly Shared Randomness

Clement Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2015 Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15  
Along the way we also highlight some other basic problems such as compression, and agreement distillation, where shared randomness plays a central role and analyze the complexity of these problems in the  ...  This result builds on the intuition that communication with imperfectly shared randomness needs to be less sensitive to its random inputs than communication with perfectly shared randomness.  ...  Acknowledgments We thank Brendan Juba for his helpful notes [7] on the invariance principle.  ... 
doi:10.1145/2688073.2688099 dblp:conf/innovations/CanonneGMS15 fatcat:jctm3kfzp5aojlyq5bgj5wjmbu

Communication With Imperfectly Shared Randomness

Clement L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan
2017 IEEE Transactions on Information Theory  
Along the way we also highlight some other basic problems such as compression, and agreement distillation, where shared randomness plays a central role and analyze the complexity of these problems in the  ...  This result builds on the intuition that communication with imperfectly shared randomness needs to be less sensitive to its random inputs than communication with perfectly shared randomness.  ...  Acknowledgments We thank Brendan Juba for his helpful notes [7] on the invariance principle.  ... 
doi:10.1109/tit.2017.2734103 fatcat:drnylyqs7rbfrbt6ice3wmklwq

Randomness? What randomness? [article]

Klaas Landsman
2019 arXiv   pre-print
This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and  ...  Although these occur with low (or even zero) probability, their very existence implies that the no-signaling principle used in proofs of randomness of outcomes of quantum-mechanical measurements (and of  ...  are computable (within a computable time bound), then Alice and Bob can signal superluminally.  ... 
arXiv:1908.07068v2 fatcat:f35dfyvkfbdnjdkfxnjzgkuhme

Randomness? What Randomness?

Klaas Landsman
2020 Foundations of physics  
This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and  ...  Although these occur with low (or even zero) probability, their very existence implies that the no-signaling principle used in proofs of randomness of outcomes of quantum-mechanical measurements (and of  ...  This protocol enables Alice (or Bob) to signal after a finite (but alas unknown and arbitrarily large) number of of measurements (this answers a speculation by Carlo Rovelli that finite-size corrections  ... 
doi:10.1007/s10701-020-00318-8 fatcat:53qo6stt2jdptcjslndi7byu4y

A fast mental poker protocol

Tzer-jen Wei, Lih-Chung Wang
2012 Journal of Mathematical Cryptology  
We present a fast and secure mental poker protocol. It is twice as fast as similar protocols, namely Barnett-Smart's and Castellà-Roca's protocols.  ...  This protocol is provably secure under DDH assumption.  ...  Player 1 and Player 3 are played by Alice. Bob follows the protocol properly but Alice may cheat. Let A 0 be the event that Alice is caught on cheating. When A 0 occurs, Game 0 is terminated.  ... 
doi:10.1515/jmc-2012-0004 fatcat:3kpexdc2frb33f66xvazsutawe

Uncontrolled Randomness in Blockchains: Covert Bulletin Board for Illicit Activities [article]

Nasser Alsalami, Bingsheng Zhang
2018 IACR Cryptology ePrint Archive  
More specifically, all major blockchain systems use randomized cryptographic primitives, such as digital signatures and non-interactive zero-knowledge proofs, and we illustrate how the uncontrolled randomness  ...  In this work, we show the severity of the problem by demonstrating that blockchains can be exploited as a covert bulletin board to secretly store and distribute arbitrary content.  ...  Paterson for his constructive comments on an early version of this work, and other anonymous reviewers for their feedback.  ... 
dblp:journals/iacr/AlsalamiZ18 fatcat:a2oczcrhnvgyfclkpbapmozs2e

Remote State Preparation of Mental Information: A Theoretical Model and a Summary of Experimental Evidence

Patrizio E. Tressoldi, Andrei Khrennikov
2012 NeuroQuantology  
Starting with the Remote State Preparation protocol, a variant of the Teleportation protocol, for which formal models and experimental evidence are already available in quantum mechanics, we outline a  ...  formal model applied to mental information we defined Remote State Preparation of Mental Information (RSPMI), and we summarise the experimental evidence supporting the feasibility of a RSPMI protocol.  ...  Acknowledgments We thank Marco Genovese and Ivano Ruo Berchera for their contributions and suggestions in particular for the data analysis.  ... 
doi:10.14704/nq.2012.10.3.570 fatcat:k4mdmdajmjglbiwpinj6sdkjyy

Randomness in quantum mechanics: philosophy, physics and technology

Manabendra Nath Bera, Antonio Acín, Marek Kuś, Morgan W Mitchell, Maciej Lewenstein
2017 Reports on progress in physics (Print)  
For this reason the article contains three parts that will be essentially devoted to different aspects of quantum randomness, and even directed, although not restricted, to various audiences: a philosophical  ...  part, a physical part, and a technological part.  ...  -SGR-875, No. 2014-SGR-966 and No. 2014-SGR-1295, and Fundació Privada Cellex.  ... 
doi:10.1088/1361-6633/aa8731 pmid:29105646 fatcat:tybxnwr6gndylb6uwdnl27fzci

Random projection-based multiplicative data perturbation for privacy preserving distributed data mining

Kun Liu, H. Kargupta, J. Ryan
2006 IEEE Transactions on Knowledge and Data Engineering  
Experiments demonstrate that the proposed technique is effective and can be successfully applied for different types of privacy-preserving data mining applications.  ...  The paper also proposes a random projection-based technique to transform the data while preserving its certain statistical characteristics.  ...  Problem: Let be an ¡ data matrix owned by Alice, and be an ¡ matrix owned by Bob.  ... 
doi:10.1109/tkde.2006.14 fatcat:ixobyet2gnem5kktxnueyrpsiy

Remote State Preparation of Mental Information [article]

Patrizio E. Tressoldi, Andrei Khrennikov
2012 arXiv   pre-print
Starting with the Remote State Preparation protocol, a variant of the Teleportation protocol, for which formal models and experimental evidence are already available in quantum mechanics, we outline a  ...  formal model applied to mental information we defined Remote State Preparation of Mental Information (RSPMI), and we summarise the experimental evidence supporting the feasibility of a RSPMI protocol.  ...  Acknowledgments We thank Marco Genovese and Ivano Ruo Berchera for their contributions and suggestions in particular for the data analysis.  ... 
arXiv:1201.6624v3 fatcat:yefexyx3vjeednlf2e3mw47as4

Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions [article]

Michael T. Goodrich, Florian Kerschbaum
2011 arXiv   pre-print
Moreover, if additional privacy protection is needed, then random sampling can be used with respect reputation scores in such a way that reputation aggregates remain useful, but individual reputation scores  ...  Finally, we show that if privacy is also desired with respect to the the reputation aggregator, then we can use zero-knowledge proofs for reputation comparisons.  ...  There are four different games that Alice and Bob can play, depending on whether each wants to give the other a positive (P) feedback or a negative feedback (N).  ... 
arXiv:1102.4602v2 fatcat:5inlhlx62vgednpnkf6xgs76lq

Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions

Michael T. Goodrich, Florian Kerschbaum
2011 Proceedings of the first ACM conference on Data and application security and privacy - CODASPY '11  
Moreover, if additional privacy protection is needed, then random sampling can be used with respect reputation scores in such a way that reputation aggregates remain useful, but individual reputation scores  ...  Finally, we show that if privacy is also desired with respect to the the reputation aggregator, then we can use zero-knowledge proofs for reputation comparisons.  ...  There are four different games that Alice and Bob can play, depending on whether each wants to give the other a positive (P) feedback or a negative feedback (N).  ... 
doi:10.1145/1943513.1943550 dblp:conf/codaspy/GoodrichK11 fatcat:izyubrubfbhcpcp3htcvtzmvve
« Previous Showing results 1 — 15 out of 1,135 results