Pages that link to "Item:Q2873641"
From MaRDI portal
The following pages link to Private Database Queries Using Somewhat Homomorphic Encryption (Q2873641):
Displaying 12 items.
- Multiuser private queries over encrypted databases (Q843366) (← links)
- Robust high capability QKD-based database private query (Q1740991) (← links)
- On the deductive security of queries to databases with multi-bit records (Q1789206) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- On the deductive security of queries to confidential databases in cloud computing systems (Q2364247) (← links)
- Applied homomorphic cryptography: examples (Q2416828) (← links)
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
- Efficient Query Protocol for Database’s Privacy (Q2917423) (← links)
- Private Conjunctive Query over Encrypted Data (Q4975185) (← links)
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates (Q5854428) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)