1 resultado para Maximal unipotent subgroups
em Boston University Digital Common
Filtro por publicador
- JISC Information Environment Repository (1)
- Repository Napier (1)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (2)
- Aberdeen University (3)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (10)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (10)
- Aquatic Commons (11)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (18)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (14)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (22)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (15)
- Boston University Digital Common (1)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (20)
- CaltechTHESIS (16)
- Cambridge University Engineering Department Publications Database (13)
- CentAUR: Central Archive University of Reading - UK (7)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (134)
- Cochin University of Science & Technology (CUSAT), India (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (32)
- Department of Computer Science E-Repository - King's College London, Strand, London (9)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (5)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (1)
- DigitalCommons@The Texas Medical Center (3)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (19)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (8)
- Greenwich Academic Literature Archive - UK (8)
- Helda - Digital Repository of University of Helsinki (57)
- Indian Institute of Science - Bangalore - Índia (118)
- Instituto Superior de Psicologia Aplicada - Lisboa (2)
- Massachusetts Institute of Technology (2)
- National Center for Biotechnology Information - NCBI (4)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (29)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (24)
- Queensland University of Technology - ePrints Archive (247)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade Federal de São Paulo - UNIFESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (48)
- Universidad de Alicante (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (2)
- Université de Montréal, Canada (9)
- University of Michigan (6)
- University of Queensland eSpace - Australia (19)
- University of Washington (2)
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.