2237 search results - page 147 / 448 » On the Security of Random Sources |
189
click to vote
CSFW
2012
IEEE
13 years 8 months ago
2012
IEEE
—We present a secure (fully abstract) compilation scheme to compile an object-based high-level language to lowchine code. Full abstraction is achieved by relying on a fine-grain...
161
click to vote
EURONGI
2008
Springer
15 years 8 months ago
2008
Springer
Sensor networks are a very specific type of wireless networks where both security and performance issues need to be solved efficiently in order to avoid manipulations of the sensed...
165
click to vote
CCS
2010
ACM
16 years 29 days ago
2010
ACM
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
169
click to vote
ENTCS
2006
15 years 6 months ago
2006
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
154
Voted
SCN
2010
Springer
15 years 4 months ago
2010
Springer
The Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for key agreement protocols. We discuss security s...