
	Where results make sense

Topic: Cryptographic protocols

Related Topics

Secure Sockets Layer

Netscape Communications Corporation

	Cryptographic protocol - Wikipedia, the free encyclopedia
		A security protocol (or cryptographic protocol) is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods.
		Cryptographic protocols are widely used for secure application-level data transport.
		There are other types of cryptographic protocols as well, and even the term itself has various different readings; Cryptographic application protocols often use one or more underlying key agreement methods, which are also sometimes themselves referred to as "cryptographic protocols".
	en.wikipedia.org /wiki/Cryptographic_protocol (206 words)

	Security Protocols over Open Networks and Distributed Systems: Formal Methods for their Analysis, Design, and ...
		After the discovery of flaws in a protocol, the flaws are often corrected or approaches are being adopted to avoid using the reasoning of the flawed protocols [4].
		In the case of protocol authentication, FDR is used to test whether the protocol correctly achieves authentication and discover a specific kind of attack of the protocol: this is the case where an intruder is masquerading as another one within a protocol run.
		The NRL Protocol Analyzer has been used successfully to locate a series of previously unknown flaws in a number of protocols [45] [46], and to demonstrate flaws that were already known in the literature [47].
	www.dmst.aueb.gr /dds/pubs/jrnl/1997-CompComm-Formal/html/formal.htm (11061 words)

	Dagstuhl Seminar 01391 "Specification and Analysis of Secure Cryptographic Protocols" (September, 23-28, 2001)
		Cryptographic protocols are the cornerstone of secure electronic communication, banking, and commerce.
		Cryptographic protocols are vulnerable to message modification attacks and it is surprisingly difficult to get even small protocols right.
		Natural candidates for a classification scheme are: synchronous versus asynchronous communication, complexity, decidability, practicability, which class of cryptographic protocols can be modelled (point-to-point, group communication, etc.), which cryptographic and other computations are supported, which analysis techniques are supported, and what is the scope, extensibility, and reusability of the modelling formalism.
	www.csl.sri.com /users/denker/dagstuhl/topics.html (654 words)

	Lewis Robart M.Sc Abstract (Site not responding. Last check: 2007-11-06)
		Cryptographic protocols, utilizing cryptographic algorithms, are used to address security issues in PCS, such as privacy and authentication.
		Cryptographic protocols may contain flaws or weaknesses; efficient and effective means of analyzing these protocols are required.
		Comparisons between protocols based on private-key and public-key cryptosystems are also presented, to aid designers in determining the appropriate cryptographic algorithm to use in specific instances.
	adonis.ee.queensu.ca /pn/robart_thesis_abs.html (300 words)

	CRYPTO Publications
		The NRL Protocol Analyzer is a prototype special-purpose verification tool, written in Prolog, that has been developed for the analysis of cryptographic protocols that are used to authenticate principals and services and distribute keys in a network.
		Initially in any protocol, there are at least two types of trust: trust that designated participants, or groups of participants, will faithfully execute their assigned function in the protocol and trust in the integrity of the transfer mechanism(s) integral to the protocol.
		The NRL Protocol Analyzer is a special-purpose verification tool, written in Prolog, that has been developed for the analysis of cryptographic protocols that are used to authenticate principals and services and distribute keys in a network.
	chacs.nrl.navy.mil /publications/CHACS/CRYPTOindex.html (6521 words)

	Verification of Cryptographic Protocols (Site not responding. Last check: 2007-11-06)
		The study of cryptography and of cryptographic protocols has received considerable attention in recent years, notably because of the growth of electronic commerce where issues like secrecy and authenticity are crucial.
		Cryptographic protocols are rules for exchanging messages using these cryptographic primitives.
		Even if the cryptographic primitives are assumed to be secure, most cryptographic protocols turn out to have errors which escape the attention of their designers.
	www2.informatik.tu-muenchen.de /lehre/WS03/verification.html (135 words)

	Claude Crépeau - Cryptographic protocols
		Protocole cryptographique de poker à l'aveugle permettant la confidentialité de la stratégie.
		Efficient reductions among oblivious transfer protocols based on new self-intersecting codes.
		Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond.
	www.cs.mcgill.ca /~crepeau/protocols.html (529 words)

	Cryptographic protocols (Site not responding. Last check: 2007-11-06)
		A calculus for cryptographic protocols: The spi calculus.
		In this paper we present a protocol to show that both BAN and AT are not expressive enough to capture all of the kinds of flaws that appear to be within their scope.
		On the properties of cryptographic protocols and the weaknesses of the BAN-like logics.
	www.di.ens.fr /~monniaux/biblio/protocols.html (1804 words)

	Analyzing cryptographic protocols (Site not responding. Last check: 2007-11-06)
		In the state machine approach, a cryptographic protocol is treated as any other computer program and an attempt is made to prove correctness.
		With this method, the protocol is modeled as an algebraic system, where the state is expressed as the participants' knowledge about the protocol, and where different states' attainability is analyzed.
		Abadi and Needham, 1994] it is given eleven design principals when designing cryptographic protocols; among those are the fact that every message should say what it means, and that the protocol designer should know which trust relations his protocol depends on, and why the dependency is necessary.
	www.pasta.cs.uit.no /thesis/html/ronnya/node30.html (693 words)

	Category:Cryptographic protocols - Wikipedia, the free encyclopedia
		Cryptographic protocols are communication protocols which are designed to provide security assurances of various kinds, using cryptographic mechanisms.
		Classic assurances include confidentiality, message integrity, and more recent research includes anonymity assurances.
		The term "protocol" is used in a wide sense, to include off-line arrangements such as encryption of e-mail messages.
	en.wikipedia.org /wiki/Category:Cryptographic_protocols (86 words)

	Network Security: Zero Knowledge and Small Systems (Site not responding. Last check: 2007-11-06)
		Zero-knowledge protocols, as their name says, are cryptographic protocols which do not reveal the information or secret itself during the protocol, or to any eavesdropper.
		This protocol can be implemented in a parallel fashion, making the public and private keys be a set of quadratic residues mod n, etc. Then you can do as many rounds in parallel as you have keys in the set, speeding up the protocol (but with larger memory requirements) and needing fewer messages.
		A protocol can also be built on top of the problem that for large graphs, it is very expensive to calculate a graph that is isomorphic to two other known graphs [3], p.
	www.tml.tkk.fi /Opinnot/Tik-110.501/1995/zeroknowledge.html (6357 words)

	Cryptographic Voting Protocols (Site not responding. Last check: 2007-11-06)
		There are three main schemes for cryptographic voting protocols: self-adjudicating, central voting authorities, and multiple voting authorities.
		Most recent cryptographic voting protocols are based on the protocol presented in ``A practical secret voting scheme for large scale elections'' by Fujioka, Okamoto, and Ohta [FOO92].
		Their protocol was the first practical method to theoretically fulfill these requirements.
	www.cs.virginia.edu /~pev5b/writing/academic/thesis/node9.html (747 words)

	The Inductive Approach to Verifying Cryptographic Protocols - Paulson (ResearchIndex) (Site not responding. Last check: 2007-11-06)
		Abstract: Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions.
		The human e#ort required to analyze a protocol can be as little as a week or two, yielding a proof script that takes a few minutes to run.
		Protocols are inductively defined as sets of traces.
	citeseer.ist.psu.edu /paulson00inductive.html (445 words)

	CIS 6930 Cryptographic Protocols
		An authentication protocol is an exchange of messages having a specific form for authentication of principals using cryptographic algorithms.
		This type was able to prove the correctness of the protocol alone, however it failed to prove the security of the protocols.
		Any logic-based method to analyze an authentication protocol will try to derive these two levels of beliefs in order to state that the authentication protocol is flawless.
	www.cise.ufl.edu /~nemo/crypto/giri.htm (1679 words)

	Cryptology ePrint Archive (Site not responding. Last check: 2007-11-06)
		A salient property of definitions that follow this paradigm is that they guarantee security even when the analyzed protocol runs alongside an unbounded number of unknown (even maliciously designed) protocols, or more generally when the protocol is used as a component of an arbitrary distributed system.
		This property is essential for maintaining security of cryptographic protocols in complex and unpredictable environments, such as the global Internet.
		We then exemplify the expressive power of this framework by capturing within it a number of standard communication models and cryptographic primitives that were traditionally defined in a variety of different ways.
	eprint.iacr.org /2000/067 (294 words)

	A Calculus for Cryptographic Protocols
		This course takes a programming language approach to solving problems in the analysis of cryptographic protocols.
		Protocol properties such as authenticity and secrecy are expressed in terms of equations and events.
		Abadi and A.D. Gordon A calculus for cryptographic protocols: the spi calculus.
	research.microsoft.com /~adg/Teaching/spi-course.html (182 words)

	A Bisimulation Method for Cryptographic Protocols (Site not responding. Last check: 2007-11-06)
		We introduce a definition of bisimulation for cryptographic protocols.
		The definition includes a simple and precise model of the knowledge of the environment with which a protocol interacts.
		Bisimulation is the basis of an effective proof technique, which yields proofs of classical security properties of protocols and also justifies certain protocol optimisations.
	research.microsoft.com /Pubs/view.aspx?pubid=162 (103 words)

	Cryptographic Polling Protocols
		The authors maintain that the simplest of their protocols does not require computations on the part of the voter that are outside ``the range of normal human ability.'' However, the more complex protocols that have fewer requirements for trusting election authorities would require the voter to bring a personal computing device into the voting booth.
		In the Two Agency Protocol developed by Nurmi, Salomaa, and Santean [15], the responsibilities of validating registered voters and computing and publishing the results of the election are divided between two agencies, as in the simplistic scheme.
		Sako, for example, proposed a protocol that is simpler but does not completely prevent election administrators from linking ballots with the voters who cast them [16].) The Sensus protocol is based closely on the Fujioka, Okamoto, and Ohta scheme.
	lorrie.cranor.org /voting/sensus/ssp/node12.html (1321 words)

	Analysis of cryptographic protocols
		My work on cryptographic protocols is in the line of formal methods research: we assume perfect cryptographic primitives (for instance, one can decrypt a message only if one has the corresponding key).
		This protocol verifier is based on a representation of the protocol by Horn clauses.
		An interesting novelty of this work with respect to classical model checking tools for the verification of cryptographic protocols is that it can handle an unbounded number of sessions of the protocol (even in parallel) and an unbounded message space.
	www.di.ens.fr /~blanchet/crypto-eng.html (791 words)

	Csur - C cryptographic protocols analyzer
		Csur is a project about automatic analysis of cryptographic protocols written in C. Csur uses a new hybrid analysis of C code: programs represent roles of agents in protocols and a static analysis computes message exchange between agents of protocols.
		is the analyzer and performs cryptographic protocols analysis.
		It's parses, analyses C source files, then produces List of Horn clauses that can be passed on to tools like SPASS or H1 to detect plausible attacks, or better, to prove formally that the input C program is secure.
	www.lsv.ens-cachan.fr /csur (681 words)

	BRICS Mini-Course: Cryptographic Protocols and Formal Methods (Site not responding. Last check: 2007-11-06)
		For a long time, cryptography and formal methods provided two almost unrelated ways of proving security of protocols: Cryptography provides precise and realistic definitions of the security of cryptographic primitives e.g., encryption and signatures, and protocols, e.g., secure channels or fair exchange.
		This is particularly useful for distributed-system aspects of protocols, which are particularly tedious and error-prone if proved by hand.
		Particular emphasis will be on the cryptographic justification of a Dolev-Yao model under active attacks and for arbitrary protocol environment.
	www.brics.dk /BRICS/MC/04/CryptographicProtocols (214 words)

	UCT CS Research Document Archive - Attack Analysis of Cryptographic Protocols Using Strand Spaces
		In fact, it is recognised that the engineering of security protocols is a challenging task, since protocols that appear secure can contain subtle flaws that attackers can exploit.
		However, when combined, these techniques all complement each other, allowing a protocol engineer to obtain a more accurate overview of the security of a protocol that is being designed.
		We give a brief overview of the concepts associated with the project, including a summary of existing security protocol analysis techniques, and a description of the strand space model, which is the intended formalism for the analysis.
	pubs.cs.uct.ac.za /archive/00000120 (258 words)

	CRYPTOGRAPHIC PROTOCOLS (Site not responding. Last check: 2007-11-06)
		The last two decades have seen a tremendous development of cryptographic protocols allowing mutually distrusting parties to evaluate a common function while leaking as little information as possible about their inputs.
		In this course we will study such protocols with an emphasis on ones that achieve a social goal.
		In particular we will concentrate of protocols for voting, protecting ownership and preserving privacy.
	www.wisdom.weizmann.ac.il /courses/crypt-prot-02.html (63 words)

	Verifying Cryptographic Protocols for Electronic Commerce (Site not responding. Last check: 2007-11-06)
		The aim of this work is to develop methods for verifying protocol correctness that will aid protocol designers at the beginning of the design process, rather than later, after the protocol is already in use.
		The tool is meant to be used to iteratively refine a protocol design.
		To model a protocol, the user inputs a description consisting of beliefs, assumptions, and initial conditions from which the tool produces high level, graphical diagrams.
	www.usenix.org /publications/library/proceedings/ec96/summaries/node9.html (305 words)

	TCS - Research - Publications - Analysis of Cryptographic Protocols via Symbolic State Space Enumeration
		Cryptographic protocols are an important building block of information security solutions.
		Many proposed security protocols have been found to have defects in their logical structures.
		Such defects can cause the protocol to be vulnerable to various kinds of attacks.
	www.tcs.hut.fi /Publications/info/ahuima.Huima99.shtml (412 words)

	Evaluating Cryptographic Protocols - Yasinsac (ResearchIndex) (Site not responding. Last check: 2007-11-06)
		Abstract: Cryptographic Protocol (CP) analysis is a topic of intense research.
		Meadows describes four approaches for CP verification under investigation in [MEA92] and several authors have categorized protocols based on types of errors they are subject to [BIRD92], [SYV93a],[SYV93b].
		This paper addresses the weakness injected into protocols when information is passed in the clear or encrypted only under the private key of a public/private key pair.
	citeseer.ist.psu.edu /yasinsac93evaluating.html (727 words)

	Universally Composable Security: A New Paradigm for Cryptographic Protocols (Site not responding. Last check: 2007-11-06)
		The salient property of universally composable definitions of security is that they guarantee security even when a secure protocol is composed with an arbitrary set of protocols, or more generally when the protocol is used as a component of an arbitrary system.
		This is an essential property for maintaining security of cryptographic protocols in complex and unpredictable environments such as the Internet.
		In particular, universally composable definitions guarantee security even when an unbounded number of protocol instances are executed concurrently in an adversarially controlled manner, they guarantee non-malleability with respect to arbitrary protocols, and more.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/focs/2001/1390/00/1390toc.xml&DOI=10.1109/SFCS.2001.959888 (306 words)

	MITRE - Our Work - Technical Papers - 2004 Technical Papers - Programming Cryptographic Protocols
		A programming language for cryptographic protocols eases design and implementation of application-specific protocols for tasks such as electronic commerce and distributed access control.
		This semantics also motivates a compilation strategy, yielding protocol implementations faithful to their verified behavior.
		We also aim to clarify the relation between the abstract models used in protocol verification and the actual behavior of protocols as implemented.
	www.mitre.org /work/tech_papers/tech_papers_04/04_0836 (161 words)

Try your search on: Qwika (all wikis)