Sciweavers

1562 search results - page 180 / 313
» Mathematics, Cryptology, Security
Sort
View
CCS
2010
ACM
14 years 3 months ago
A logic for authorization provenance
In distributed environments, statements from a number of principals, besides the central trusted party, may influence the derivations of authorization decisions. However, existin...
Jinwei Hu, Yan Zhang, Ruixuan Li, Zhengding Lu
FSE
2009
Springer
136views Cryptology» more  FSE 2009»
14 years 8 months ago
MAC Reforgeability
Message Authentication Codes (MACs) are core algorithms deployed in virtually every security protocol in common usage. In these protocols, the integrity and authenticity of messag...
John Black, Martin Cochran
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 1 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
CRYPTO
2005
Springer
149views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Authenticating Pervasive Devices with Human Protocols
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
Ari Juels, Stephen A. Weis
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
14 years 1 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...