Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Private Database Queries Using Somewhat Homomorphic Encryption

From MaRDI portal
Publication:2873641
Jump to:navigation, search

DOI10.1007/978-3-642-38980-1_7zbMath1330.94037OpenAlexW36213310MaRDI QIDQ2873641

No author found.

Publication date: 24 January 2014

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38980-1_7



Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60)


Related Items (8)

On the deductive security of queries to confidential databases in cloud computing systems ⋮ Polynomial representation is tricky: maliciously secure private set intersection revisited ⋮ Applied homomorphic cryptography: examples ⋮ On the deductive security of queries to databases with multi-bit records ⋮ Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem ⋮ Private Conjunctive Query over Encrypted Data ⋮ A geometric approach to homomorphic secret sharing ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates







This page was built for publication: Private Database Queries Using Somewhat Homomorphic Encryption

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2873641&oldid=15821846"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki