Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
999
PROVIDER INDEPENDENT CRYPTOGRAPHIC TOOLS
, 2003
"... finally completed. With that, I would like to say thank you to those who has contributed to the success of this project directly or indirectly. Firstly, I would like to express my gratitude to RMC for its financial support which has made it possible for the completion of this project. Special thanks ..."
Abstract
- Add to MetaCart
of the project. I also would like to thank my research assistant, Shah Rizan Abdul Aziz, who has spent an enormous amount of time in designing and development the cryptographic library. He also spent a considerable amount of time in preparing this report, thank you again. Last but not least, I wish to thank my
Provably Secure Substitution of Cryptographic Tools
, 2006
"... With the development of provable security techniques, cryptographers have seen tension arise between what is practical and what can be proven. In particular, the use of simulation to prove security of protocols against malicious parties requires that "special powers" be available to the ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
With the development of provable security techniques, cryptographers have seen tension arise between what is practical and what can be proven. In particular, the use of simulation to prove security of protocols against malicious parties requires that "special powers" be available
Binomial Sieve Series A Prospective Cryptographic Tool
"... Abstract: a Binomial Sieve Series (BSS) is an infinite monotonic set of natural numbers, b1, b2,.....bn ( bi < bi+1) generated, („naturally‟) from any two natural numbers (x, y ≤ x). If one repeatedly counts bi elements over the set X = 1,2,….x (recycled counting) and eliminates each time the ele ..."
Abstract
- Add to MetaCart
(in count and length) have no simple pattern, their disorder is reminiscent of primes. We suggest some intriguing cryptographic applications based on the poor predictability of the next element in each series, combined with good predictability of the computational load to develop the series (by
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
- IN 14TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP (CSFW-14
, 2001
"... We present a new automatic cryptographic protocol verifier based on a simple representation of the protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This verifier proves secrecy properties of the protocols. Thanks to its ..."
Abstract
-
Cited by 391 (11 self)
- Add to MetaCart
We present a new automatic cryptographic protocol verifier based on a simple representation of the protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This verifier proves secrecy properties of the protocols. Thanks to its
New directions in cryptography.
- IEEE Trans. Inf. Theory,
, 1976
"... Abstract Two kinds of contemporary developments in cryp-communications over an insecure channel order to use cryptogtography are examined. Widening applications of teleprocess-raphy to insure privacy, however, it currently necessary for the ing have given rise to a need for new types of cryptograph ..."
Abstract
-
Cited by 3542 (7 self)
- Add to MetaCart
of cryptographic communicating parties to share a key which is known to no systems, which minimize the need for secure key distribution one else. This is done by sending the key in advance over some channels and supply the equivalent of a written signature. This secure channel such a private courier or registered
Automated Analysis of Cryptographic Protocols Using Murphi
, 1997
"... A methodology is presented for using a generalpurpose state enumeration tool, Murphi, to analyze cryptographic and security-related protocols. We illustrate the feasibility of the approach by analyzing the Needham-Schroeder protocol, finding a known bug in a few seconds of computation time, and anal ..."
Abstract
-
Cited by 296 (25 self)
- Add to MetaCart
A methodology is presented for using a generalpurpose state enumeration tool, Murphi, to analyze cryptographic and security-related protocols. We illustrate the feasibility of the approach by analyzing the Needham-Schroeder protocol, finding a known bug in a few seconds of computation time
A Cryptographic File System for Unix
, 1993
"... Although cryptographic techniques areplaying an increasingly important role in modern computing system security,userlevel tools for encrypting file data arecumbersome and suffer from a number of inherent vulnerabilities. The Cryptographic File System (CFS) pushes encryption services into the file sy ..."
Abstract
-
Cited by 269 (4 self)
- Add to MetaCart
Although cryptographic techniques areplaying an increasingly important role in modern computing system security,userlevel tools for encrypting file data arecumbersome and suffer from a number of inherent vulnerabilities. The Cryptographic File System (CFS) pushes encryption services into the file
Reasoning about Belief in Cryptographic Protocols
- Proceedings 1990 IEEE Symposium on Research in Security and Privacy
, 1990
"... Abstract. Analysis methods for cryptographic protocols have often focused on information leakage rather than on seeing whether a protocol meets its goals. Many protocols, however, fall far short of meeting their goals, sometimes for quite subtle reasons. We introduce a mechanism for reasoning about ..."
Abstract
-
Cited by 222 (6 self)
- Add to MetaCart
years have brought forth the need for rigorous analysis methods. Formal tools must be provided to determine whether a solution indeed solves a problem, as well as to enable comparisons between proposed solutions. In this paper we propose a method for reasoning about cryptographic protocols in a
Trapdoors for Hard Lattices and New Cryptographic Constructions
, 2007
"... We show how to construct a variety of “trapdoor ” cryptographic tools assuming the worstcase hardness of standard lattice problems (such as approximating the shortest nonzero vector to within small factors). The applications include trapdoor functions with preimage sampling, simple and efficient “ha ..."
Abstract
-
Cited by 191 (26 self)
- Add to MetaCart
We show how to construct a variety of “trapdoor ” cryptographic tools assuming the worstcase hardness of standard lattice problems (such as approximating the shortest nonzero vector to within small factors). The applications include trapdoor functions with preimage sampling, simple and efficient
Results 1 - 10
of
999
