An analysis of proxy signatures: is a secure channel necessary?

Authors:
Jung-Yeun Lee;Jung Hee Cheon;Seungjoo Kim
Affiliations:
International Research Center for Information Security, Information and Communications Univ., Korea;International Research Center for Information Security, Information and Communications Univ., Korea;Korea Information Security Agency, Korea
Venue:
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Year:
2003

Citing 5
Cited 17

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
LFSR-based Hashing and Authentication

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
MMH: Software Message Authentication in the Gbit/Second Rates

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Software-optimized universal hashing and message authentication

Software-optimized universal hashing and message authentication

Comments on "A Practical (t,n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem'

IEEE Transactions on Knowledge and Data Engineering
Improvement of Yang et al.'s threshold proxy signature scheme

Journal of Systems and Software
Delegation with supervision

Information Sciences: an International Journal
A secure identity-based multi-proxy signature scheme

Computers and Electrical Engineering
Secure Proxy Multi-signature Scheme in the Standard Model

ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Designated verifier proxy signature scheme without random oracles

Computers & Mathematics with Applications
Efficient Authorization in Delegation Chains with Strong Non-Repudiation

Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Convertible undeniable proxy signatures: security models and efficient construction

WISA'07 Proceedings of the 8th international conference on Information security applications
Proxy signatures secure against proxy key exposure

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Efficient ID-based proxy signature and proxy signcryption form bilinear pairings

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
A short proxy signature scheme: efficient authentication in the ubiquitous world

EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Revisiting fully distributed proxy signature schemes

INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Security model of proxy-multi signature schemes

CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Identity-based proxy signature from pairings

ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
A new proxy signature scheme with a semi-trusted third party based on elliptic curve discrete logarithm problem

International Journal of Security and Networks
On provably secure code-based multiple grade proxy signature scheme

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Montgomery Prime Hashing (MPH) is a scheme for message authentication based on universal hashing.I n MPH, roughly speaking, the hash value is computed as the Montgomery residue of the message with respect to a secret modulus.The modulus value is structured in a way that allows fast, compact implementations in both hardware and software.The set of allowed modulus values is large, and as a result, MPH achieves good, provable security. MPH performance is comparable to that of other high-speed schemes such as MMH. An advantage of MPH is that the secret key (i.e., the modulus) is small, typically 128-256 bits, while in MMH the secret key is typically much larger.I n applications where MMH key length is problematic, MPH may be an attractive alternative.