Spreading alerts quietly and the subgroup escape problem

Authors:
James Aspnes;Zoë Diamadi;Kristian Gjøsteen;René Peralta;Aleksandr Yampolskiy
Affiliations:
Department of Computer Science, Yale University, New Haven, CT;Department of Computer Science, Yale University, New Haven, CT;Department of Telematics, Norwegian University of Science and Technology, Trondheim, Norway;Department of Computer Science, Yale University, New Haven, CT;Department of Computer Science, Yale University, New Haven, CT
Venue:
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Year:
2005

Citing 26
Cited 0

An efficient solution of the congruence x2+ky2=m (modn)

IEEE Transactions on Information Theory
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
A new elliptic curve based analogue of RSA

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Flash mixing

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing rational points on rank 1 elliptic curves via L-series and canonical heights

Mathematics of Computation
Primality testing using elliptic curves

Journal of the ACM (JACM)
Elliptic curves in cryptography

Elliptic curves in cryptography
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Homomorphic Signature Schemes

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Public Key Cryptosystem Based on the Subgroup Membership Problem

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Mix-Networks on Permutation Networks

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Constructing elliptic curves with given group order over large finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An efficient signature scheme based on quadratic equations

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Symmetric subgroup membership problems

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Anonymous connections and onion routing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has not been known how to construct such commitments before. We show that the BCM has natural and important applications. In particular, we use it to construct a mechanism for transmitting alerts undetectably in a message-passing system of n nodes. Our algorithms allow an alert to quickly propagate to all nodes without its source or existence being detected by an adversary, who controls all message traffic. Our proofs of security are based on a new subgroup escape problem, which seems hard on certain groups with bilinear pairings and on elliptic curves over the ring ℤn.