47 search results - page 4 / 10 » A Note on Security Proofs in the Generic Model |
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
According to one common view, information security comes down to technical measures. Given better access control policy models, formal proofs of cryptographic protocols, approved ...
TYPES
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
PKC
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
ACNS
2004
Springer
13 years 11 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...