Sciweavers

281 search results - page 36 / 57
» Non-black-box Techniques in Cryptography
Sort
View
EUROCRYPT
2007
Springer
14 years 4 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
ACNS
2006
Springer
78views Cryptology» more  ACNS 2006»
14 years 3 months ago
DSO: Dependable Signing Overlay
Dependable digital signing service requires both high fault-tolerance and high intrusion-tolerance. While providing high fault-tolerance, existing approaches do not satisfy the hig...
Guofei Gu, Prahlad Fogla, Wenke Lee, Douglas M. Bl...
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
14 years 3 months ago
Toward Privacy in Public Databases
Abstract. We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who...
Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam...
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
14 years 3 months ago
A Method to Solve Cyclotomic Norm Equations
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Nick Howgrave-Graham, Michael Szydlo
CHES
2004
Springer
170views Cryptology» more  CHES 2004»
14 years 3 months ago
Concurrent Error Detection Schemes for Involution Ciphers
Because of the rapidly shrinking dimensions in VLSI, transient and permanent faults arise and will continue to occur in the near future in increasing numbers. Since cryptographic c...
Nikhil Joshi, Kaijie Wu, Ramesh Karri