Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
831
End-To-End Arguments In System Design
, 1984
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract
-
Cited by 1037 (10 self)
- Add to MetaCart
This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost
The inductive approach to verifying cryptographic protocols
- Journal of Computer Security
, 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract
-
Cited by 480 (29 self)
- Add to MetaCart
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can
Argument
, 2012
"... Counting letters in written texts is a very ancient practice. It has accompanied the development of Cryptology, Quantitative Linguistics, and Statistics. In Cryptology, counting frequencies of the different characters in an encrypted message is the basis of the so called frequency analysis method. I ..."
Abstract
- Add to MetaCart
Counting letters in written texts is a very ancient practice. It has accompanied the development of Cryptology, Quantitative Linguistics, and Statistics. In Cryptology, counting frequencies of the different characters in an encrypted message is the basis of the so called frequency analysis method
Probabilistically Checkable Arguments
"... We give a general reduction that converts any public-coin interactive proof into a one-round (two-message) argument. The reduction relies on a method proposed by Aiello et al. [ABOR00], of using a Private-Information-Retrieval (PIR) scheme to collapse rounds in interactive protocols. For example, th ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
We give a general reduction that converts any public-coin interactive proof into a one-round (two-message) argument. The reduction relies on a method proposed by Aiello et al. [ABOR00], of using a Private-Information-Retrieval (PIR) scheme to collapse rounds in interactive protocols. For example
Expander graph arguments for message passing algorithms
- IEEE Trans. on Inform. Theory
, 2001
"... We show how expander based arguments may be used to prove that message passing algorithms can correct a linear number of erroneous messages. The implication of this result is that when the block length is sufficiently large, once a message passing algorithm has corrected a sufficiently large fractio ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
We show how expander based arguments may be used to prove that message passing algorithms can correct a linear number of erroneous messages. The implication of this result is that when the block length is sufficiently large, once a message passing algorithm has corrected a sufficiently large
A Minimum Message Length Approach for Argument Interpretation
- In Proceedings of the 3rd SIGdial Workshop on Discourse and Dialogue
, 2002
"... We describe a mechanism which receives as input a segmented argument composed of NL sentences, and generates an interpretation. ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We describe a mechanism which receives as input a segmented argument composed of NL sentences, and generates an interpretation.
The effect of message framing on breast selfexamination attitudes, intentions and behaviour
- Journal of Personality and Social Psychology
, 1987
"... In this study we tested the framing hypothesis that a pamphlet stressing the negative consequences of not performing breast self-examination (BSE) would be more persuasive than a pamphlet empha-sizing BSE's positive consequences. College-aged female subjects were exposed to a loss-frame pam-phl ..."
Abstract
-
Cited by 110 (0 self)
- Add to MetaCart
-phlet, a gain-frame pamphlet, or a no-arguments pamphlet, or they received no pamphlet describing the importance of and the techniques for performing BSE. Attitudes toward BSE and intentions to perform BSE were assessed immediately after this intervention and again 4 months later. The follow-up also
Succinct arguments from . . .
, 2012
"... Succinct arguments of knowledge are computationally-sound proofs of knowledge for NP where the verifier’s running time is independent of the time complexity t of the nondeterministic NP machine M that decides the given language. Existing succinct argument constructions are, typically, based on techn ..."
Abstract
- Add to MetaCart
t · polylog(t) and space s · polylog(t) and the verifier runs in time |x | · polylog(t). (2) We show how to transform any one-round MIP protocol to a succinct four-message argument (with
Proving Properties of Security Protocols by Induction
- In 10th IEEE Computer Security Foundations Workshop
, 1997
"... Informal justifications of security protocols involve arguing backwards that various events are impossible. Inductive definitions can make such arguments rigorous. The resulting proofs are complicated, but can be generated reasonably quickly using the proof tool Isabelle/HOL. There is no restriction ..."
Abstract
-
Cited by 167 (8 self)
- Add to MetaCart
Informal justifications of security protocols involve arguing backwards that various events are impossible. Inductive definitions can make such arguments rigorous. The resulting proofs are complicated, but can be generated reasonably quickly using the proof tool Isabelle
Meanings and Messages
, 1991
"... The problem of meaning in DAI systems is examined in some depth. Agents in DAI systems communicate by exchanging messages, as well as by sensing and acting upon their environment, although message exchange is the focus of the current argument. The problem for such systems is that of determining t ..."
Abstract
- Add to MetaCart
The problem of meaning in DAI systems is examined in some depth. Agents in DAI systems communicate by exchanging messages, as well as by sensing and acting upon their environment, although message exchange is the focus of the current argument. The problem for such systems is that of determining
Results 1 - 10
of
831
