Sciweavers

258 search results - page 29 / 52
» Securing Provenance
Sort
View
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 2 days ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
COMPSAC
2005
IEEE
15 years 5 months ago
Buffer Overrun Prevention Through Component Composition Analysis
Buffer overrun vulnerabilities cause significant security problems, and have proven to be difficult to prevent. In this paper we present a novel approach to tackling the problem...
David Llewellyn-Jones, Madjid Merabti, Qi Shi, Bob...
JOC
2010
124views more  JOC 2010»
14 years 10 months ago
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
Yvo Desmedt, Rosario Gennaro, Kaoru Kurosawa, Vict...
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr