Sciweavers

242 search results - page 26 / 49
» Randomness in Cryptography
Sort
View
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
15 years 10 months ago
Non-malleable Obfuscation
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
Ran Canetti, Mayank Varia
ICDCS
2009
IEEE
15 years 6 months ago
Distributed Key Generation for the Internet
Although distributed key generation (DKG) has been studied for some time, it has never been examined outside of the synchronous setting. We present the first realistic DKG archit...
Aniket Kate, Ian Goldberg
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
15 years 6 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
PDP
2007
IEEE
15 years 3 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
CHES
2007
Springer
165views Cryptology» more  CHES 2007»
15 years 3 months ago
FPGA Intrinsic PUFs and Their Use for IP Protection
In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. In [34], Simpson and Schaumont proposed a fundamentally different approach to...
Jorge Guajardo, Sandeep S. Kumar, Geert Jan Schrij...