1,735,144 research outputs found
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs (Extended Abstract)
No full text) Mitsuhiro Okada Department of Philosophy Keio University, Tokyo Abstract We give a natural extension of Girard's phase semantics of the linear logic [1] to the classical and intuitionistic higher order linear logics and give a uniform phase-semantic proof of the higher order cut-elimination theorem as well as the completeness theorem. Although our proof in this paper is mainly concentrated on the framework of linear logic, the proof technique works for various different logical systems uniformly, too. We also extend our phase semantics for provability to phase semantics for proofs, by modifying the phase space of monoid domain to that of proofs domain, in a natural way. The resulting phase semantics for proofs provides various versions of proof-normalization theorem. The details of this extension will appear in the full-version of this paper. 1 Introduction Phase space semantics was introduced by Girard[1] for a completeness proof (with respect to provability) of linear logic. Alt..
How to Use RSA; or How to Improve the Efficiency of RSA without Loosing its Security (Extended Abstract)
No full textPublished in U. Schulte, Ed., ISSE 2002, on CD-ROM, Paris, France, October 2--4, 2002.] Marc Joye and Pascal Paillier Gemplus Card International, France {marc.joye, pascal.paillier}@gemplus.com http://www.gemplus.com/smart/ Abstract. It is striking to observe the progressive explosion of RSA key lengths. Although this trend clearly corresponds to a (legitimate) ever-increasing need for a guaranteed security level, this paper considers alternative, more e#cient, secure implementations of RSA with respect to industrial constraints
A Robust and Verifiable Cryptographically Secure Election Scheme †
No full text(Extended Abstract) Cryptographic techniques are becoming important fo
Towards a Theory of Data Entanglement?
No full text1 Introduction Suppose that I provide you with remote storage for your most valuable infor-mation. I may advertise various desirable properties of my service: underground disk farms protected from nuclear attack, daily backups to chiseled granite mon-uments, replication to thousands of sites scattered across the globe. But what assurance do you have that I will not maliciously delete your data as soon asyour subscription check clears
Abstract An Optimally Robust Hybrid Mix Network
No full textWe present a mix network that achieves efficient integration of public-key and symmetric-key operations. This hybrid mix network is capable of natural processing of arbitrarily long input elements, and is fast in both practical and asymptotic senses. While the overhead in the size of input elements is linear in the number of mix servers, it is quite small in practice. In contrast to previous hybrid constructions, ours has optimal robustness, that is, robustness against any minority coalition of malicious servers.
Diagrammatic Representation of Interval Space in Proving Theorems about Interval Relations
No full textThe paper introduces a two-dimensional graphical representation for the space of intervals (the IS-diagram) and arrangement interval relations (the W-diagram). The usefulness of the representations is illustrated with the example of proving equivalence of different characterizations of convex interval relations
1. Introduction Quantitative Analysis of Symbolic Execution
No full textThe correctness of programs has always been a concern for software engineers. A typical engineer tests
Fabry-Perot Doppler imaging observations at Syowa Station, Antarctica (extended abstract)
No full textAbstract On-the-Fly Verification of Erasure-Encoded File Transfers
No full textThe quality of peer-to-peer content distribution can suffer from the malicious behavior of participants that corrupt or mislabel content. While systems using simple block-byblock downloading can verify blocks using traditional cryptographic signatures, these same techniques may not be applied to more elegant systems that rely on erasure codes for efficient multi-source download. This paper presents a practical scheme, based on homomorphic hashing, that enables a downloader to perform on-the-fly verification of erasureencoded blocks.
- …
