Sciweavers

2967 search results - page 507 / 594
» Cryptology
Sort
View
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
15 years 6 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
15 years 6 months ago
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
15 years 6 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
15 years 6 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
15 years 6 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård