Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/66276
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Pontes, Rogério | por |
dc.contributor.author | Pinto, Mário | por |
dc.contributor.author | Barbosa, Manuel | por |
dc.contributor.author | Vilaça, Ricardo Manuel Pereira | por |
dc.contributor.author | Matos, Miguel Ângelo Marques | por |
dc.contributor.author | Oliveira, Rui Carlos Mendes de | por |
dc.date.accessioned | 2020-08-04T16:42:19Z | - |
dc.date.issued | 2017 | - |
dc.identifier.isbn | 9781450344869 | por |
dc.identifier.uri | https://hdl.handle.net/1822/66276 | - |
dc.description.abstract | The privacy of information is an increasing concern of software applications users. This concern was caused by attacks to cloud services over the last few years, that have leaked confidential information such as passwords, emails and even private pictures. Once the information is leaked, the users and software applications are powerless to contain the spread of information and its misuse. With databases as a central component of applications that store almost all of their data, they are one of the most common targets of attacks. However, typical deployments of databases do not leverage security mechanisms to stop attacks and do not apply cryptographic schemes to protect data. This issue has been tackled by multiple secure databases that provide trade-offs between security, query capabilities and performance. Despite providing stronger security guarantees, the proposed solutions still entrust their data to a single entity that can be corrupted or hacked. Secret sharing can solve this problem by dividing data in multiple secrets and storing each secret at a different location. The division is done in such a way that if one location is hacked, no information can be leaked. Depending on the protocols used to divide data, functions can be computed over this data through secure protocols that do not disclose information or actually know which values are being calculated. We propose a SQL database prototype capable of offering a trade-off between security and query latency by using a different secure protocol. An evaluation of the protocols is also performed, showing that our most relaxed protocol has an improvement of 5% on the query latency time over the original protocol. | por |
dc.description.sponsorship | This work was partially funded by project ”NORTE-01-0145-FEDER-000016”, financed by the North Portugal Re-gional Operational Programme (NORTE 2020), under thePORTUGAL 2020 Partnership Agreement, and through theEuropean Regional Development Fund (ERDF | por |
dc.language.iso | eng | por |
dc.publisher | Association for Computing Machinery (ACM) | por |
dc.rights | restrictedAccess | por |
dc.subject | Derby | por |
dc.subject | Multi-party computation | por |
dc.subject | Secret sharing | por |
dc.subject | Secure databases | por |
dc.title | Performance trade-offs on a secure multi-party relational database | por |
dc.type | conferencePaper | por |
dc.peerreviewed | yes | por |
oaire.citationStartPage | 456 | por |
oaire.citationEndPage | 461 | por |
oaire.citationVolume | Part F128005 | por |
dc.date.updated | 2020-08-03T13:21:00Z | - |
dc.identifier.doi | 10.1145/3019612.3019659 | por |
dc.date.embargo | 10000-01-01 | - |
sdum.export.identifier | 5735 | - |
sdum.conferencePublication | Proceedings of the ACM Symposium on Applied Computing | por |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Performance trade-offs on a secure multi-party relational database.pdf Acesso restrito! | 400,48 kB | Adobe PDF | Ver/Abrir |