1 resultado para Maximal arc
em Boston University Digital Common
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (4)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (11)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (15)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (7)
- Biblioteca Valenciana Digital - Ministerio de Educación, Cultura y Deporte - Valencia - Espanha (2)
- Bibloteca do Senado Federal do Brasil (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (35)
- Boston University Digital Common (1)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (13)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (51)
- CentAUR: Central Archive University of Reading - UK (13)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (52)
- Cochin University of Science & Technology (CUSAT), India (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (45)
- Department of Computer Science E-Repository - King's College London, Strand, London (10)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (3)
- Digital Commons - Montana Tech (3)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (4)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (60)
- Greenwich Academic Literature Archive - UK (6)
- Helda - Digital Repository of University of Helsinki (4)
- Indian Institute of Science - Bangalore - Índia (36)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (2)
- Ministerio de Cultura, Spain (9)
- National Center for Biotechnology Information - NCBI (4)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (108)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (31)
- Queensland University of Technology - ePrints Archive (161)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (61)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (1)
- Universidade Federal do Pará (2)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (4)
- Université de Montréal (3)
- Université de Montréal, Canada (6)
- University of Michigan (130)
- University of Queensland eSpace - Australia (22)
- University of Southampton, United Kingdom (3)
Resumo:
A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.