Sciweavers

610 search results - page 81 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
DCC
2005
IEEE
15 years 11 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
IPPS
2008
IEEE
15 years 6 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
ATAL
2005
Springer
15 years 5 months ago
Law-governed Linda as a semantics for agent dialogue protocols
Tuple spaces and the associated Linda language are a popular model for distributed computation, and Law-Governed Linda (LGL) is a variant allowing processes to have differential ...
Sylvie Doutre, Peter McBurney, Michael Wooldridge
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 3 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
15 years 3 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba