315 search results - page 63 / 63 » Number Theoretic Attacks on Secure Password Schemes |
SACMAT
2006
ACM
13 years 11 months ago
2006
ACM
In recent years, trust negotiation (TN) has been proposed as a novel access control solution for use in open system environments in which resources are shared across organizationa...
PAIRING
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
NDSS
2006
IEEE
13 years 11 months ago
2006
IEEE
Software monocultures are usually considered dangerous because their size and uniformity represent the potential for costly and widespread damage. The emerging concept of collabor...
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...