Sciweavers

64 search results - page 10 / 13
» Practical unconditionally secure two-channel message authent...
Sort
View
CCS
2010
ACM
14 years 10 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
80
Voted
CISC
2008
Springer
117views Cryptology» more  CISC 2008»
14 years 11 months ago
Strong Anonymous Signatures
The notion of anonymous signatures has recently been formalized by [18], which captures an interesting property that a digital signature can sometimes hide the identity of the sign...
Rui Zhang 0002, Hideki Imai
ISPEC
2010
Springer
14 years 11 months ago
Certificateless KEM and Hybrid Signcryption Schemes Revisited
Often authentication and confidentiality are required as simultaneous key requirements in many cryptographic applications. The cryptographic primitive called signcryption effective...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
105
Voted
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 4 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CSFW
2008
IEEE
15 years 4 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi