783 search results - page 37 / 157 » On security proof of McCullagh |
PKC
2012
Springer
12 years 9 days ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...
COCO
2009
Springer
14 years 4 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
EGCDMAS
2004
13 years 11 months ago
2004
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...