Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Open problems in electronic commerce
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 7th ACM conference on Computer and communications security
A unifying look at data structures
Communications of the ACM
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: 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
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The random oracle methodology, revisited
Journal of the ACM (JACM)
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security (TISSEC)
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
Proceedings of the 15th ACM conference on Computer and communications security
Access Control Friendly Query Verification for Outsourced Data Publishing
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Non-interactive Range Proof
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual 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
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Authenticating kNN query results in data publishing
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Super-efficient verification of dynamic outsourced databases
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Authenticating multi-dimensional query results in data publishing
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Authentication of outsourced databases using signature aggregation and chaining
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Non-interactive zero-knowledge arguments for voting
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A New Model for Secure Dissemination of XML Content
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.00 |
In the third-party model for the distribution of data, the data owner provides a third party (referred to as the dealer) with data as well as integrity verification information for that data, in the form of digital signatures that the dealer can use to convince a user of the data's integrity (the dealer is not trusted with the owner's signature keys, which is why it receives pre-signed items). The user's interactions are with the dealer, who is in charge of enforcing access control and confidentiality for the data (i.e., no user should learn more than the outcome of their authorized query). This kind of outsourcing is becoming increasingly important because of its advantageous economics - a dealer who acts as a repository for many owners can achieve economies of scale that are not feasible for the individual owners, and the model allows the data owners to focus on what they do best (the creation and/or acquisition of high-quality data). A problem that arises in the context of outsourced databases (particularly for XML data) is the following: There is a total order Π on n items stored with the dealer, and a user query consists of a pair of items whose relative ordering should be revealed along with a proof that the result is correct. The proof is generated using the dealer's local data (i.e., without bothering the data owner). The main difficulty is achieving efficient storage and query-processing while achieving the desiderata (that the user should learn nothing other than the answer to their query, and that a misbehaving dealer should not be able to convince a user of a wrong ordering). This paper gives a solution that is provably secure under a new assumption and can efficiently generate a very short proof. Furthermore, this scheme is generalized to partial orders that can be decomposed into d total orders. In this case, a user either learns the ordering of the queried items, or learns that they are incomparable.