Sciweavers

1777 search results - page 51 / 356
» Programming Cryptographic Protocols
Sort
View
CSFW
2007
IEEE
14 years 3 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
SECPERU
2006
IEEE
14 years 2 months ago
Using One-Way Chains to Provide Message Authentication without Shared Secrets
The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret ...
Bogdan Groza
ASIACRYPT
2003
Springer
14 years 10 days ago
Efficient Group Signatures without Trapdoors
Abstract. Group signature schemes are fundamental cryptographic tools that enable unlinkably anonymous authentication, in the same fashion that digital signatures provide the basis...
Giuseppe Ateniese, Breno de Medeiros
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
IANDC
2008
84views more  IANDC 2008»
13 years 7 months ago
Authenticating ad hoc networks by comparison of short digests
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
L. H. Nguyen, A. W. Roscoe