2432 search results - page 256 / 487 » Cryptographic logical relations |
134
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
136
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
167
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
156
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Considering the solution of dynamic access problems in a user hierarchy, a novel scheme based on one-way hash function is proposed to manage the cryptographic keys in the paper. T...
179
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...