A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Comparing information without leaking it
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Performance Evaluation of Privacy-Preserving Policy Reconciliation Protocols
POLICY '07 Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Most large-scale data communication networks are built from multiple autonomous subnetworks, which are managed by different administrative entities. In many practical environments, information about traffic policies is considered proprietary and is not disclosed by network operators. However, some operational scenarios require routers within a network to check if traffic matches a particular policy that is provided by another entity. In our work, we present several algorithms of how to represent policy databases and how to perform policy checks without explicitly disclosing the total set of policies. This privacy-preserving set operation extends related work, which has assumed that parties trust each other. Our analysis shows that the proposed policy checks can be implemented efficiently in realistic systems.