Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
41
Protocol modeling, textual analysis, the bifurcation/bootstrapping method, and Convince Me: Computer-based techniques for studying beliefs and their revision
- Behavior Research Methods, Instruments, and Computers
, 1995
"... This paper traces a progression of four computer-based methods for studying and fostering both the structure and the on-line development of knowledge. Each empirical technique employs ECHO, a connectionist model that instantiates the theory of explanatory coherence (TEC). First, verbal protocols of ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper traces a progression of four computer-based methods for studying and fostering both the structure and the on-line development of knowledge. Each empirical technique employs ECHO, a connectionist model that instantiates the theory of explanatory coherence (TEC). First, verbal protocols
Eviction of Misbehaving and Faulty Nodes in Vehicular Networks
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2007
"... Vehicular networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to be detected and prevented from disrupting n ..."
Abstract
-
Cited by 51 (6 self)
- Add to MetaCart
Vehicular networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to be detected and prevented from disrupting
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork
- CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract
-
Cited by 119 (10 self)
- Add to MetaCart
of the presumed hard problem. A notable feature of our construction is that it can be implemented using all known instantiations of the bilinear pairing (whether symmetric or asymmetric, with our without a computable or 2 invertible homomorphism, etc.). To cover all grounds, we describe both a symmetric IBE
Securing Vehicular Communications - Assumptions, Requirements, and Principles
- WORKSHOP ON EMBEDDED SECURITY IN CARS
, 2006
"... Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards the deployment of vehicular communication systems, security and privacy are critical factors and significant chall ..."
Abstract
-
Cited by 31 (7 self)
- Add to MetaCart
Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards the deployment of vehicular communication systems, security and privacy are critical factors and significant
Moderate structural realism about space-time
- Synthese
, 2008
"... This paper sets out a moderate version of metaphysical structural realism that stands in contrast to both the epistemic structural realism of Worrall and the – radical – ontic structural realism of French and Ladyman. According to moderate structural realism, objects and relations (structure) are on ..."
Abstract
-
Cited by 42 (16 self)
- Add to MetaCart
can be applied to space-time, providing for a convincing understanding of space-time points in the standard tensor formulation of general relativity as well as in the fibre bundle formulation. 1. Moderate in contrast to radical structural realism Structural realism is a position in the philosophy
Implementing Polymorphism in SMT solvers ∗
"... Based on our experience with the development of Alt-Ergo, we show a small number of modifications needed to bring parametric polymorphism to our SMT solver. The first one occurs in the typing module where unification is now necessary for solving polymorphic constraints over types. The second one con ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
consists in extending triggers ’ definition in order to deal with both term and type variables. Last, the matching module must be modified to account for the instantiation of type variables. We hope that this experience is convincing enough to raise interest for polymorphism in the SMT community. 1
Certificate Revocation in Vehicular Networks
, 2006
"... Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards their deployment, security is a critical factor and significant challenge to be met. In this paper, we are concern ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards their deployment, security is a critical factor and significant challenge to be met. In this paper, we
Parallel repetition of computationally sound protocols revisited
- IN 4TH TCC, SPRINGER, LECTURE NOTES IN COMPUTER SCIENCE
, 2007
"... Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1997) show that this is also true for protocols where the soundness only holds against computationally bounded provers (e.g. inte ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
is not very convincing as the communication complexity of each instance of the protocol grows linearly with the number of repetitions, and for such protocols the error does not even decrease for some types of interactive proofs. Noticing this, Bellare et al. construct (a quite artificial) oracle relative
Explanation Styles in iDocument
"... Abstract. The information extraction system iDocument interactively extracts information from text such as instances and relations with respect to existing background knowledge. An extraction process creates weighted recommendations describing indications of relevant information. During execution, e ..."
Abstract
- Add to MetaCart
, each process step records its output into an instantiated process model. We reused these bits of information for generating conceptual, functional as well as causal explanations. The purpose of these explanations is to illustrate the evolution of recommendations for convincing users of their validity
A non-interactive range proof with constant communication
- In Financial Cryptography and Data Security
, 2012
"... Abstract. In a range proof, the prover convinces the verifier in zeroknowledge that he has encrypted or committed to a value a ∈ [0,H] where H is a public constant. Most of the previous non-interactive range proofs have been proven secure in the random oracle model. We show that one of the few previ ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Abstract. In a range proof, the prover convinces the verifier in zeroknowledge that he has encrypted or committed to a value a ∈ [0,H] where H is a public constant. Most of the previous non-interactive range proofs have been proven secure in the random oracle model. We show that one of the few
Results 1 - 10
of
41
