An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Separability and Efficiency for Generic Group Signature Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A second-price sealed-bid auction with verifiable discriminant of ρo-th root
FC'02 Proceedings of the 6th international conference on Financial cryptography
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Ciphertext comparison, a new solution to the millionaire problem
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
A range test secure in the active adversary model
ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Secure multiparty computation of DNF
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Efficiency improvement of homomorphic e-auction
TrustBus'10 Proceedings of the 7th international conference on Trust, privacy and security in digital business
Practicalization of a range test and its application to e-auction
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
| Hi-index | 0.00 |
In a range test, one party holds a ciphertext and needs to test whether the message encrypted in the ciphertext is within a certain interval range. In this paper, a range test protocol is proposed, where the party holding the ciphertext asks another party holding the private key of the encryption algorithm to help him. These two parties run the protocol to implement the test. The test returns TRUE if and only if the encrypted message is within the certain interval range. If the two parties do not conspire, no information about the encrypted message is revealed from the test except what can be deduced from the test result. Advantages of the new protocol over the existing related techniques are that it achieves correctness, soundness, flexibility, high efficiency and privacy simultaneously.