33 search results - page 1 / 7 » Public-Key Encryption with Lazy Parties |
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
CTRSA
2010
Springer
13 years 11 months ago
2010
Springer
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
INFORMATICALT
2006
13 years 4 months ago
2006
A convertible authenticated encryption scheme allows a specified recipient to recover and verify a message simultaneously. Moreover the recipient can prove the dishonesty of the se...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...