scholarly journals Probabilistic Proof Systems

1994 ◽  
Vol 1 (28) ◽  
Author(s):  
Oded Goldreich

Various types of <em>probabilistic</em> proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such proof systems -- <em>interactive proofs</em>, <em>zero-knowledge proofs</em>, and <em>probabilistic checkable proofs</em> -- stressing the essential role of randomness in each of them.<br /> <br />This exposition is an expanded version of a survey written for the proceedings of the International Congress of Mathematicians (<em>ICM94</em>) held in Zurich in 1994. It is hope that this exposition may be accessible to a broad audience of computer scientists and mathematians.

2021 ◽  
pp. 127-132
Author(s):  
Simone Natale

The historical trajectory examined in this book demonstrates that humans’ reactions to machines that are programmed to simulate intelligent behaviors represent a constitutive element of what is commonly called AI. Artificial intelligence technologies are not just designed to interact with human users: they are designed to fit specific characteristics of the ways users perceive and navigate the external world. Communicative AI becomes more effective not only by evolving from a technical standpoint but also by profiting, through the dynamics of banal deception, from the social meanings humans project onto situations and things. In this conclusion, the risks and problems related to AI’s banal deception are explored in relationship with other AI-based technologies such as robotics and social media bots. A call is made for initiating a more serious debate about the role of deception in interface design and computer science. The book concludes with a reflection on the need to develop a critical and skeptical stance in interactions with computing technologies and AI. In order not to be found unprepared for the challenges posed by AI, computer scientists, software developers, designers as well as users have to consider and critically interrogate the potential outcomes of banal deception.


Author(s):  
Jon Barwise ◽  
John Etchemendy

A major concern to the founders of modern logic—Frege, Peirce, Russell, and Hilbert—was to give an account of the logical structure of valid reasoning. Taking valid reasoning in mathematics as paradigmatic, these pioneers led the way in developing the accounts of logic which we teach today and that underwrite the work in model theory, proof theory, and definability theory. The resulting notions of proof, model, formal system, soundness, and completeness are things that no one claiming familiarity with logic can fail to understand, and they have also played an enormous role in the revolution known as computer science. The success of this model of inference led to an explosion of results and applications. But it also led most logicians—and those computer scientists most influenced by the logic tradition—to neglect forms of reasoning that did not fit well within this model. We are thinking, of course, of reasoning that uses devices like diagrams, graphs, charts, frames, nets, maps, and pictures. The attitude of the traditional logician to these forms of representation is evident in the quotation of Neil Tennant in Chapter I, which expresses the standard view of the role of diagrams in geometrical proofs. One aim of our work, as explained there, is to demonstrate that this dogma is misguided. We believe that many of the problems people have putting their knowledge of logic to work, whether in machines or in their own lives, stems from the logocentricity that has pervaded its study for the past hundred years. Recently, some researchers outside the logic tradition have explored uses of diagrams in knowledge representation and automated reasoning, finding inspiration in the work of Euler, Venn, and especially C. S. Peirce. This volume is a testament to this resurgence of interest in nonlinguistic representations in reasoning. While we applaud this resurgence, the aim of this chapter is to strike a cautionary note or two. Enchanted by the potential of nonlinguistic representations, it is all too easy to overreact and so to repeat the errors of the past.


2020 ◽  
Author(s):  
Zhenbin Yan ◽  
Yi Deng

Abstract Round complexity is one of the fundamental problems in zero-knowledge (ZK) proof systems. Non-malleable zero-knowledge (NMZK) protocols are ZK protocols that provide security even when man-in-the-middle adversaries interact with a prover and a verifier simultaneously. It is known that the first constant-round public-coin NMZK arguments for NP can be constructed by assuming the existence of collision-resistant hash functions (Pass, R. and Rosen, A. (2005) New and Improved Constructions of Non-Malleable Cryptographic Protocols. In Gabow, H.N. and Fagin, R. (eds) Proc. 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 2224, 2005, pp. 533542. ACM) and has relatively high round complexity; the first four-round private-coin NMZK arguments for NP can be constructed in the plain model by assuming the existence of one-way functions (Goyal, V., Richelson, S., Rosen, A. and Vald, M. (2014) An Algebraic Approach to Non-Malleability. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 1821, 2014, pp. 4150. IEEE Computer Society and Ciampi, M., Ostrovsky, R., Siniscalchi, L. and Visconti, I. (2017) Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. In Kalai, Y. and Reyzin, L. (eds) Theory of Cryptography15th Int. Conf., TCC 2017. Lecture Notes in Computer Science, Baltimore, MD, USA, November 1215, 2017, Part I, Vol. 10677, pp. 711742. Springer). In this paper, we present a six-round public-coin NMZK argument of knowledge system assuming the existence of collision-resistant hash functions and a three-round private-coin NMZK argument system from multi-collision resistance of hash functions assumption in the keyless setting.


2012 ◽  
Vol 50 (01) ◽  
Author(s):  
N Lange ◽  
S Sieber ◽  
A Erhardt ◽  
G Sass ◽  
HJ Kreienkamp ◽  
...  

1995 ◽  
Vol 74 (05) ◽  
pp. 1323-1328 ◽  
Author(s):  
Dominique Lasne ◽  
José Donato ◽  
Hervé Falet ◽  
Francine Rendu

SummarySynthetic peptides (TRAP or Thrombin Receptor Activating Peptide) corresponding to at least the first five aminoacids of the new N-terminal tail generated after thrombin proteolysis of its receptor are effective to mimic thrombin. We have studied two different TRAPs (SFLLR, and SFLLRN) in their effectiveness to induce the different platelet responses in comparison with thrombin. Using Indo-1/AM- labelled platelets, the maximum rise in cytoplasmic ionized calcium was lower with TRAPs than with thrombin. At threshold concentrations allowing maximal aggregation (50 μM SFLLR, 5 μM SFLLRN and 1 nM thrombin) the TRAPs-induced release reaction was about the same level as with thrombin, except when external calcium was removed by addition of 1 mM EDTA. In these conditions, the dense granule release induced by TRAPs was reduced by over 60%, that of lysosome release by 75%, compared to only 15% of reduction in the presence of thrombin. Thus calcium influx was more important for TRAPs-induced release than for thrombin-induced release. At strong concentrations giving maximal aggregation and release in the absence of secondary mediators (by pretreatment with ADP scavengers plus aspirin), SFLLRN mobilized less calcium, with a fast return towards the basal level and induced smaller lysosome release than did thrombin. The results further demonstrate the essential role of external calcium in triggering sustained and full platelet responses, and emphasize the major difference between TRAP and thrombin in mobilizing [Ca2+]j. Thus, apart from the proteolysis of the seven transmembrane receptor, another thrombin binding site or thrombin receptor interaction is required to obtain full and complete responses.


1979 ◽  
Vol 42 (04) ◽  
pp. 1193-1206 ◽  
Author(s):  
Barbara Nunn

SummaryThe hypothesis that platelet ADP is responsible for collagen-induced aggregation has been re-examined. It was found that the concentration of ADP obtaining in human PRP at the onset of aggregation was not sufficient to account for that aggregation. Furthermore, the time-course of collagen-induced release in human PRP was the same as that in sheep PRP where ADP does not cause release. These findings are not consistent with claims that ADP alone perpetuates a collagen-initiated release-aggregation-release sequence. The effects of high doses of collagen, which released 4-5 μM ADP, were not inhibited by 500 pM adenosine, a concentration that greatly reduced the effect of 300 μM ADP. Collagen caused aggregation in ADP-refractory PRP and in platelet suspensions unresponsive to 1 mM ADP. Thus human platelets can aggregate in response to collagen under circumstances in which they cannot respond to ADP. Apyrase inhibited aggregation and ATP release in platelet suspensions but not in human PRP. Evidence is presented that the means currently used to examine the role of ADP in aggregation require investigation.


Sign in / Sign up

Export Citation Format

Share Document