Sciweavers

1875 search results - page 168 / 375
» Modeling the Security of Steganographic Systems
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ECBS
1999
IEEE
138views Hardware» more  ECBS 1999»
15 years 5 months ago
Multi-Domain Surety Modeling and Analysis for High Assurance Systems
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...
James Davis, Jason Scott, Janos Sztipanovits, Marc...
105
Voted
JUCS
2008
113views more  JUCS 2008»
15 years 21 days ago
What is Correctness of Security Protocols?
: As soon as major protocol flaws were discovered empirically -- a good luck that is not older than the early 1990s -- this title question came up to the world. It was soon realise...
Giampaolo Bella
127
Voted
ESEM
2010
ACM
14 years 11 months ago
Strengthening the empirical analysis of the relationship between Linus' Law and software security
Open source software is often considered to be secure because large developer communities can be leveraged to find and fix security vulnerabilities. Eric Raymond states Linus’ L...
Andrew Meneely, Laurie A. Williams
120
Voted
EUROCRYPT
2010
Springer
15 years 4 months ago
Efficient Lattice (H)IBE in the Standard Model
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
Shweta Agrawal, Dan Boneh, Xavier Boyen