Blockchain Papers

Stephen King

No abstract is available for this record.

Nobuki Mochida

No abstract is available for this record.

John Brannigan

One of the preferred methods of beginning a New Historicist reading is the depiction of a scene or piece of writing which yields a microcosmic image of what the critic seeks to elaborate in relation to the main text of discussion. So Stephen Greenblatt begins 'Invisible Bullets', his acclaimed article named after the false understandings that American Indians had of the ways in which Europeans were destroying them (believing that the smallpox which was obliterating them was in fact the invisible bullets of the Europeans), with a story of how red spots on the face of the dying mathematician, Thomas Harriot, were falsely believed to be proof of revenge from God for Harriot's alleged atheism. Whether Harriot was an atheist or not we have no way of knowing, for, as Greenblatt reminds us, '[t]he historical evidence, of course, is unreliable' (Greenblatt, in Wilson and Dutton 1992, 84).1 In its first published form the article also began with the story of an Italian miller tried of heresy by the Inquisition who, having finally renounced his atheist views, was allowed to return to life in his village, albeit branded as heretic, but on returning to his atheist views was then burned at the stake.

Alfredo De Santis, Giuseppe Persiano

No abstract is available for this record.

Markus Jakobsson, Moti Yung

No abstract is available for this record.

Hoi‐Kwong Lo, H. F. Chau

There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this ``no-go theorem'': Unconditionally secure bit commitment schemes based on quantum mechanics---fully quantum, classical or quantum but with measurements---are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-cold-war'' applications. We also show that ideal quantum coin tossing is impossible because of the EPR attack. This no-go theorem for ideal quantum coin tossing may help to shed some lights on the possibility of non-ideal protocols.

Jacques Stern

The present paper investigates the possibility of designing zero-knowledge identification schemes based on hard problems from coding theory. Zero-knowledge proofs were introduced by Goldwasser, Micali, and Rackoff (1985). Their practical significance was soon demonstrated in the work of Fiat and Shamir [1986], who turned zero-knowledge proofs of quadratic residuosity into efficient means of establishing user identities. In the present paper, we propose a new identification scheme, based on error-correcting codes, which is zero-knowledge and seems of practical value. Furthermore, we describe several variants, including one which has an identity-based character. The security of our schemes depends on the hardness of finding a word of given syndrome and prescribed (small) weight with respect to some randomly generated binary linear error-correcting code. This is, of course, not the first attempt to design a cryptographic scheme using tools from coding theory. The difference is that identification protocols do not follow the public key paradigm based on trap-door functions and described in the seminal Diffie-Hellman paper [1976]. Rather, they only require one-way functions, which opens the way to using, in a rather direct manner, simple combinatorial problems of the kind provided by coding theory. The resulting schemes compare favorably to their number-theoretic analogs.

Shai Halevi, Silvio Micali

No abstract is available for this record.

Vincent Peloso, Barbara A. Tenenbaum

Looking at the Latin American liberal project during the century of postindependence, this collection of original essays draws attention to an underappreciated dilemma confronting liberals: idealistic visions and fiscal restraints. Liberals, Politics, and Power focuses on the inventiveness of nineteenth-century Latin Americans who applied liberal ideology to the founding and maintenance of new states. The impact of liberalism in Latin America, the contributors show, is best understood against the larger backdrop of struggles that pitted regional demands against the pressures of foreign finance, a powerful church against a decentralized state, and aristocratic desire to retain privilege against rising demands for social mobility.Moving beyond the traditional historiographical division between Eurocentric and dependency theories, the essays attempt to account for a uniquely Latin American liberal ideology and politics by exploring the political dynamics of such countries as Mexico, Colombia, Argentina, and Peru. Contributors discuss liberal efforts to build a viable legal order through elections and to implement a means of public finance that could fund the states' operations. Essays that span the entire century address issues such as the emergence of caudillos, the role of artisans, and popular participation in elections in light of fiscal, and other, impediments to progress.In their introduction, Vincent C. Peloso and Barbara A. Tenenbaum provide a hemispheric overview of liberalism that illustrates its similarities across Latin America. By exploring the liberal constitutional and economic order lying beneath apparently dictatorial states, this pathbreaking volume underlines the importance of fiscal policy in the fashioning of state power. Liberals, Politics, and Power serves not only as a guide to the liberal principles and practices that governed state formation in nineteenth-century Latin America but also as a means to evaluate the complex relationship between ideas and practical politics.

Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano

The input to the Graph Clustering Problem consists of a sequence of integers m 1 ; :::; m t and a sequence of P t i=1 m i graphs. The question is whether the equivalence classes, under the graph isomorphism relation, of the input graphs have sizes which match the input sequence of integers. In this note we show that this problem has a (perfect) zero-knowledge interactive proof system. Keywords: Graph Isomorphism, Zero-Knowledge Interactive Proofs. 1 Introduction The remarkable notion of perfect zero-knowledge proofs was introduced by Goldwasser, Micali and Rackoff [GoMiRa]. A perfect zero-knowledge proof system is a method for a prover to convince a polynomial-time bounded verifier with very high probability that a certain assertion is true without revealing any additional information (in an information-theoretic sense). Not many are the languages which have been shown to have a perfect zero-knowledge proof system; in particular, all of them share number-theoretic or random self-red...

Richard H. Acker, Daniel M. Kammen

No abstract is available for this record.

Robin Boadway, Isao Horiba, Raghbendra Jha, Boadway, Robin · 6 authors

It has realized since Pigou (1947) that if public goods are financed by distortionary taxation, the marginal social cost of providing the public good will exceed the actual resource cost by the marginal deadweight cost of taxation.

Tatsuaki Okamoto

No abstract is available for this record.

Ronald Cramer, Ivan Damgård

We present a 4-move zero-knowledge proof system [21] for any NP language L, which allows showing that x 2 L with error probability less than 2 \\Gammak using communication corresponding to O(jxj c )+O(k) bit commitments, where c is a constant depending only on L. We also present a 4-move perfect zero knowledge interactive argument for any NP-language L. On input x 2 L, the communication complexity is O(jxj c ) \\Delta max(k; l) bits, where l is the security parameter for the prover 1 . The protocols can be based on any bit commitment scheme with a particular set of properties. We suggest efficient implementations based on discrete logarithms or factoring. As a function of the security parameters, our protocols have the smallest known asymptotic communication complexity among general proofs or arguments for NP. Moreover, the constants involved are small enough for the protocols to be practical in a realistic situation: our protocols allows proving/arguing satisfiability of a Boo...

Oded Goldreich, Ariel Kahan

No abstract is available for this record.

Mark Bray

No abstract is available for this record.

Bonnie J. Knutson, Martin Malk, Raymond S. Schmidgall

Most directors of marketing intuitively know that accepting some business has an opportunity cost of not being able to accept potentially more lucrative business. The decision becomes particularly critical when the prospective contract is for a large event, such as a conference. Some hotels address this matter by, for instance, requiring executive committee approval for all large contracts or all business that involves function space. The decision can be made much earlier and more simply by individual sales representatives or sales managers, however, if they analyze the tradeoffs of any potential contract. An analytical approach can be built into a spreadsheet calculation that takes into account such variables as special room rates, potential banquet revenues and costs, and revenues and costs of other services (e.g., audio-visual support). The decision is more than quantitative, however, and must take into account such factors as the effect on other guests' perceptions of the hotel if, say, facilities are jammed by conventioneers. Those effects cannot be modeled on a spreadsheet and are subject to the marketing director's judgment.

Carolyn Johnson, Theresa A. Nicklas, Gerald S. Berenson

No abstract is available for this record.

Stanley A. Kochanek

T HE PROLIFERATION OF INTEREST GROUPS and the explosion of group advocacy in the United States and other liberal democracies in the 1980s has led to a renewed attention to the comparative study of interest politics. Among the major questions at issue is the relationship between political, social and economic change and group formation, proliferation, organizational maintenance and group action. Interest group theory suggests that groups proliferate during periods of rapid change. As India approaches its first half century of independence, a study of changes in its interest group system provides an excellent opportunity to attempt to assess the impact of systemic change on interest group development and behavior.' In the decades since independence and especially since 1980, India has experienced an accelerated process of economic, social and political change. The Indian rate of economic growth has increased, literacy rates have risen sharply, the pace of urbanization has quickened and most importantly the size of its middle class has increased significantly. These economic and social changes have been accompanied by striking political and policy changes that include the decline of party, heightened pressure for decentralization and fundamental alteration of India's past model of planned development. These changes have begun to alter the nature and conduct of interest politics in India. India has experienced an increase in the mobilization, proliferation and transformation of groups and significant changes in interest group roles, styles and strategies. As a result the Indian system of state-dominated pluralism in which autonomous groups were overshadowed by an omnipresent state2 is eroding as interest politics have

Yung‐Hsiang Chen, Tzonelih Hwang

No abstract is available for this record.

Priscilla Wohlstetter, Richard J. Wenning, Kerri L. Briggs

By the end of 1994, 11 states had passed legislation authorizing charter schools. Following the argument that charter schools need to be autonomous, self-governing organizations to enhance their potential for high performance, this study explores legislative conditions that promote charter school autonomy. The study applies a conceptual framework of autonomy to assess variations among state charter school policies. 7he results suggest that state policies offer different levels of autonomy and thus charter schools will vary in their ability to innovate and in their potential for high performance. Differences in autonomy across charter school laws appear to be related to state political cultures and to the state's history of decentralization reform.

Michael L. Nance, Francis C. Nance

No abstract is available for this record.

Joan Boyar, Gilles Brassard, René Peralta

The communication complexity of zero-knowledge proof systems is improved. Let C be a Boolean circuit of size n. Previous zero-knowledge proof systems for the satisfiability of C require the use of Omega (kn) bit commitments in order to achieve a probability of undetected cheating not greater than 2/sup -k/. In the case k=n, the communication complexity of these protocols is therefore Omega (n/sup 2/) bit commitments. A zero-knowledge proof is given for achieving the same goal with only O(n/sup m/+k square root n/sup m/) bit commitments, where m=1+ epsilon /sub n/ and epsilon /sub n/ goes to zero as n goes to infinity. In the case k=n, this is O(n square root n/sup m/). Moreover, only O(k) commitments need ever be opened, which is interesting if committing to a bit is significantly less expensive than opening a commitment.>

Richard Shillito, Eric Barendt

Abstract Dissatisfaction with the law of libel has been prevalent for some time. Critics have pointed to three areas in particular as requiring reform. First, they have said that rules of pleading in libel actions are unnecessarily arcane and that the interlocutory process is unduly complex. Secondly, it is said that awards of damages are out of proportion to the loss suffered. One consequence is that defendants have in general thrown more legal resources into litigation, which in turn has increased the costs penalty for the unsuccessful litigant. A third criticism is that the balance between plaintiff and defendant, both procedurally and in relation to the burden of proof, may be tilted too far in the plaintiff’s favour. (The suggestion that, perhaps, the burden of proof ought to be reversed and placed on the plaintiff has gained increased respectability, though it has not convinced everyone.) An important incidental effect of these deficiencies in the law, say critics, is that recourse to law is too complex and expensive. The result is that, at one extreme, the impecunious plaintiff may be deprived of a remedy and, on the other hand, with so much at stake financially for the unsuccessful defendant, the law may fetter freedom of speech.