1 resultado para Predicate Encryption
em Duke University
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Repository Napier (1)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Archive On-line (Mid Sweden University; Sweden) (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (5)
- Archive of European Integration (1)
- Aston University Research Archive (10)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (12)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (12)
- CentAUR: Central Archive University of Reading - UK (9)
- Cochin University of Science & Technology (CUSAT), India (12)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (38)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Dalarna University College Electronic Archive (3)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- Digital Commons at Florida International University (12)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (18)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (1)
- Helvia: Repositorio Institucional de la Universidad de Córdoba (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Instituto Politécnico do Porto, Portugal (6)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Memorial University Research Repository (2)
- Nottingham eTheses (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (2)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (32)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- Scielo Saúde Pública - SP (2)
- Universidad de Alicante (3)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (29)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade do Minho (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (6)
- Universita di Parma (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (6)
- University of Michigan (8)
- University of Queensland eSpace - Australia (15)
- University of Southampton, United Kingdom (6)
- University of Washington (2)
- WestminsterResearch - UK (2)
Resumo:
Encryption and integrity trees guard against phys- ical attacks, but harm performance. Prior academic work has speculated around the latency of integrity verification, but has done so in an insecure manner. No industrial implementations of secure processors have included speculation. This work presents PoisonIvy, a mechanism which speculatively uses data before its integrity has been verified while preserving security and closing address-based side-channels. PoisonIvy reduces per- formance overheads from 40% to 20% for memory intensive workloads and down to 1.8%, on average.