Sciweavers

25 search results - page 5 / 5
» Soundness of Formal Encryption in the Presence of Active Adv...
Sort
View
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
13 years 11 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
ASIACRYPT
2009
Springer
13 years 12 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
CCS
2009
ACM
14 years 5 days ago
A security-preserving compiler for distributed programs: from information-flow policies to cryptographic mechanisms
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
Cédric Fournet, Gurvan Le Guernic, Tamara R...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ACISP
2006
Springer
13 years 11 months ago
Towards Provable Security for Ubiquitous Applications
Abstract. The emergence of computing environments where smart devices are embedded pervasively in the physical world has made possible many interesting applications and has trigger...
Mike Burmester, Tri Van Le, Breno de Medeiros