STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Zero-knowledge proofs of identity
Journal of Cryptology
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of the ACM (JACM)
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
One-Round Secure Computation and Secure Autonomous Mobile Agents
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Optimistic Fair Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Privacy preserving route planning
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
A secure distributed framework for achieving k-anonymity
The VLDB Journal — The International Journal on Very Large Data Bases
OACerts: Oblivious Attribute Certificates
IEEE Transactions on Dependable and Secure Computing
Homomorphic encryption and secure comparison
International Journal of Applied Cryptography
Distributed privacy preserving k-means clustering with additive secret sharing
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
A New Protocol for Conditional Disclosure of Secrets and Its Applications
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Financial Cryptography and Data Security
Secure two-party point-circle inclusion problem
Journal of Computer Science and Technology
Privacy-Preserving Face Recognition
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Efficient and secure comparison for on-line auctions
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Secure multiparty computation of DNF
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Secure computation of the vector dominance problem
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Anonymous biometric access control
EURASIP Journal on Information Security - Special issue on enhancing privacy protection in multimedia systems
Efficient privacy-preserving face recognition
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Sub-linear, secure comparison with two non-colluding parties
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Filtering for private collaborative benchmarking
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Truly efficient string oblivious transfer using resettable tamper-proof tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
OACerts: oblivious attribute certificates
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
An efficient solution to the millionaires' problem based on homomorphic encryption
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Secure outsourcing of sequence comparisons
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
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
Conditional encrypted mapping and comparing encrypted numbers
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
International Journal of Data Warehousing and Mining
An efficient and probabilistic secure bit-decomposition
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
Based on the quadratic residuosity assumption we present a non-interactive crypto-computing protocol for the greater-than function, i.e., a non-interactive procedure between two parties such that only the relation of the parties' inputs is revealed. In comparison to previous solutions our protocol reduces the number of modular multiplications significantly. We also discuss applications to conditional oblivious transfer, private bidding and the millionaires' problem.