Sciweavers

346 search results - page 52 / 70
» The Secret Santa Problem
Sort
View
ARCS
2004
Springer
14 years 1 months ago
A Note on Certificate Path Verification in Next Generation Mobile Communications
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
Matthias Enzmann, Elli Giessler, Michael Haisch, B...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
EUROCRYPT
2008
Springer
13 years 11 months ago
Towards Key-Dependent Message Security in the Standard Model
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security...
Dennis Hofheinz, Dominique Unruh
JOC
2002
99views more  JOC 2002»
13 years 9 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
SOCIALCOM
2010
13 years 4 months ago
A Multi-factor Approach to Securing Software on Client Computing Platforms
Protecting the integrity of software platforms, especially in unmanaged consumer computing systems is a difficult problem. Attackers may attempt to execute buffer overflow attacks ...
Raghunathan Srinivasan, Vivek Iyer, Amit Kanitkar,...