163 search results - page 19 / 33 » Relaxing Chosen-Ciphertext Security |
MP
2010
13 years 2 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
SPW
2005
Springer
14 years 1 months ago
2005
Springer
This paper recounts some lessons that we learned from the deployment of host-to-host IPsec in a large corporate network. Several security issues arise from mismatches between the d...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
ESOP
2010
Springer
13 years 11 months ago
2010
Springer
Language-based information flow methods offer a principled way to enforce strong security properties, but enforcing noninterference is too inflexible for realistic applications. Se...