6164 search results - page 185 / 1233 » Teaching Computer Security |
154
click to vote
CSFW
2007
IEEE
16 years 26 days ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
135
click to vote
FSTTCS
2007
Springer
16 years 21 days ago
2007
Springer
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
183
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
153
click to vote
MOC
2010
15 years 1 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
170
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Architecting security solutions for today’s diverse computer systems is a challenge. The modern business environment is comprised of many different applications, e-mail, databas...