61 search results - page 7 / 13 » On Security Notions for Verifiably Encrypted Signature |
IEICET
2006
13 years 7 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
IEEEARES
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
ASIACRYPT
2006
Springer
13 years 11 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...
EUROCRYPT
2010
Springer
14 years 9 days ago
2010
Springer
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...