Results 1  10
of
4,046
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 821 (23 self)
 Add to MetaCart
more general cler of inductive types, cals, "strictly positive", and to ease the strong normalgAg9Ik proof of theresulGGg system. Thisresul provides a computation model for the combination of anal"DAfGI specification language based on abstract data types and of astrongl typed functional
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 480 (20 self)
 Add to MetaCart
. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 448 (2 self)
 Add to MetaCart
, as the proof has nothing to do with the Ricci flow, and (2) the claim about the lower bound for the volumes of the maximal horns and the smoothness of the solution from some time on, which turned out to be unjustified, and, on the other hand, irrelevant for the other conclusions. The Ricci flow with surgery
On the Composition of ZeroKnowledge Proof Systems
 SIAM Journal on Computing
, 1990
"... : The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too. We ..."
Abstract

Cited by 208 (15 self)
 Add to MetaCart
: The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too
ArgumentBased Extended Logic Programming With Defeasible Priorities
"... . Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logicprogramming language with both weak and strong negation. Conflicts between arguments are decided with the help of priorities on the rules. An i ..."
Abstract

Cited by 248 (28 self)
 Add to MetaCart
. Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logicprogramming language with both weak and strong negation. Conflicts between arguments are decided with the help of priorities on the rules
Games and Full Completeness for Multiplicative Linear Logic
 JOURNAL OF SYMBOLIC LOGIC
, 1994
"... We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the den ..."
Abstract

Cited by 243 (26 self)
 Add to MetaCart
is the denotation of a unique cutfree proof net. A key role is played by the notion of historyfree strategy; strong connections are made between historyfree strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We
Dynamic accumulators and application to efficient revocation of anonymous credentials
, 2002
"... We introduce the notion of a dynamic accumulator. Anaccumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one to dynamically add and delete a value, such th ..."
Abstract

Cited by 213 (11 self)
 Add to MetaCart
, such that the cost of an add or delete is independent of the number of accumulated values. We provide a construction of a dynamic accumulator and an efficient zeroknowledge proof of knowledge of an accumulated value. We prove their security under the strong RSA assumption. We then show that our construction
The secure remote password protocol
 In Proceedings of the 1998 Internet Society Network and Distributed System Security Symposium
, 1998
"... This paper presents a new password authentication and keyexchange protocol suitable for authenticating users and exchanging keys over an untrusted network. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak passphrase ..."
Abstract

Cited by 212 (6 self)
 Add to MetaCart
it directly to compromise security and gain immediate access to the host. This new protocol combines techniques of zeroknowledge proofs with asymmetric key exchange protocols and o ers signi cantly improved performance over comparably strong extended methods that resist stolenveri er attacks
A Privacy Awareness System for Ubiquitous Computing Environments
, 2002
"... Protecting personal privacy is going to be a prime concern for the deployment of ubiquitous computing systems in the real world. With daunting Orwellian visions looming, it is easy to conclude that tamperproof technical protection mechanisms such as strong anonymization and encryption are the on ..."
Abstract

Cited by 203 (3 self)
 Add to MetaCart
Protecting personal privacy is going to be a prime concern for the deployment of ubiquitous computing systems in the real world. With daunting Orwellian visions looming, it is easy to conclude that tamperproof technical protection mechanisms such as strong anonymization and encryption
Hail: A highavailability and integrity layer for cloud storage,” in
 Proc. Of CCS’09,
, 2009
"... ABSTRACT We introduce HAIL (HighAvailability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and retrievable. HAIL strengthens, formally unifies, and streamlines distinct approaches from the cryptographic and d ..."
Abstract

Cited by 195 (4 self)
 Add to MetaCart
progressively corrupt the full set of servers. We propose a strong, formal adversarial model for HAIL, and rigorous analysis and parameter choices. We show how HAIL improves on the security and efficiency of existing tools, like Proofs of Retrievability (PORs) deployed on individual servers. We also report on a
Results 1  10
of
4,046