skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
Nuida, K. ; Hanaoka, G.
IEEE transactions on information theory, 2013-01, Vol.59 (1), p.635-652
[Periódico revisado por pares]
New York, NY: IEEE
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
Autor:
Nuida, K.
;
Hanaoka, G.
Assuntos:
Algorithms
;
Applied sciences
;
Computation
;
Computer information security
;
Cryptographic protocols
;
Cryptography
;
Data privacy
;
Exact sciences and technology
;
Generators
;
Information theory
;
Information, signal and communications theory
;
Information-theoretic security
;
Niobium
;
Pseudorandom
;
pseudorandom generator (PRG)
;
Random number generation
;
Randomness
;
randomness reduction
;
Reduction
;
Signal and communications theory
;
Telecommunications and information theory
É parte de:
IEEE transactions on information theory, 2013-01, Vol.59 (1), p.635-652
Notas:
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição:
In this paper, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence, the PRG-based randomness reduction can be effective even for information-theoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of "nb-PRGs" and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.
Editor:
New York, NY: IEEE
Idioma:
Inglês
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
4
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript