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 ...
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
: APEX: Automated Policy Enforcement eXchange Steven J. Simske, Helen Balinsky HP Laboratories HPL-2010-134 Policy, Text Analysis, Policy Server, Policy Editor, Document Systems, ...
a revised version of the extended abstract which appeared in The Cryptographers’ Track at RSA Conference ’2001 (8 – 12 april 2001, San Francisco, California, USA)
Abstract. Mobile Ad-hoc Networks (MANETs) are very dynamic networks with devices continuously entering and leaving the group. The highly dynamic nature of MANETs renders the manual...