Results 1 - 10
of
17,679
Multiparty unconditionally secure protocols
- In STOC ’88: Proceedings of the twentieth annual ACM symposium on Theory of computing
, 1988
"... Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1. ..."
Abstract
-
Cited by 556 (12 self)
- Add to MetaCart
Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1.
SPINS: Security Protocols for Sensor Networks
, 2001
"... As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized ..."
Abstract
-
Cited by 1094 (30 self)
- Add to MetaCart
As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. We design a suite of security building blocks that are optimized
Secrecy by Typing in Security Protocols
- Journal of the ACM
, 1998
"... We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use shared-key cryptography. The rules have the form of typing rules for a basic co ..."
Abstract
-
Cited by 273 (10 self)
- Add to MetaCart
We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use shared-key cryptography. The rules have the form of typing rules for a basic
Security Protocol
"... • Security Protocols are hard to verify by hand due to their complexity • Automated verification is desirable ..."
Abstract
- Add to MetaCart
• Security Protocols are hard to verify by hand due to their complexity • Automated verification is desirable
Security Protocols
"... Abstract. Privacy enhancing security protocols (PESPs) are a family of protocols that allow secure exchange of sensitive user information. They are important in preserving users privacy in today’s open environment. Like other security systems, proof of the correctness of PESPs is necessary before th ..."
Abstract
- Add to MetaCart
Abstract. Privacy enhancing security protocols (PESPs) are a family of protocols that allow secure exchange of sensitive user information. They are important in preserving users privacy in today’s open environment. Like other security systems, proof of the correctness of PESPs is necessary before
of Security Protocols
, 2007
"... We present an architecture and tools for verifying implementations of security protocols. Our implementations can run with both concrete and symbolic implementations of cryptographic algorithms. The concrete implementation is for production and interoperability testing. The symbolic implementation i ..."
Abstract
- Add to MetaCart
We present an architecture and tools for verifying implementations of security protocols. Our implementations can run with both concrete and symbolic implementations of cryptographic algorithms. The concrete implementation is for production and interoperability testing. The symbolic implementation
Verifying Security Protocols with Brutus
, 2000
"... this article we present BRUTUS, a tool for verifying properties of security protocols. This tool can be viewed as a special-purpose model checker for security protocols. We also present reduction techniques that make the tool efficient. Experimental results are provided to demonstrate the efficiency ..."
Abstract
-
Cited by 67 (4 self)
- Add to MetaCart
this article we present BRUTUS, a tool for verifying properties of security protocols. This tool can be viewed as a special-purpose model checker for security protocols. We also present reduction techniques that make the tool efficient. Experimental results are provided to demonstrate
Security Protocol
- In Proceedings of International Workshop, (Cambridge, United Kingdom), Springer-Verlag, LNCS
, 1996
"... Neuronal growth cones are the highly motile structures at the tip of axons that can detect guidance cues in the environment and transduce this information into directional movement towards the appropriate target cell. To fully understand how guidance information is transmitted from the cell surface ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
be microinjected with a variety of probes for studying growth cone motility and guidance. In the present protocol we demonstrate a procedure for dissection of the abdominal ganglion, culture of bag cell neurons and setting up an imaging chamber for live cell imaging of growth cones.
Security Protocols
"... c ○ 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other ..."
Abstract
- Add to MetaCart
c ○ 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Decision Process for Automated Selection of
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
Results 1 - 10
of
17,679