3115 search results - page 313 / 623 » Synthesizing Secure Protocols |
205
click to vote
CRYPTO
2007
Springer
16 years 26 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
193
click to vote
CSFW
2004
IEEE
15 years 10 months ago
2004
IEEE
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
182
click to vote
SIGCOMM
2010
ACM
15 years 6 months ago
2010
ACM
Security functions such as access control, encryption and authentication are typically left up to applications on the modern Internet. There is no unified system to implement thes...
177
click to vote
ACSAC
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
191
click to vote
ACNS
2007
Springer
16 years 26 days ago
2007
Springer
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...