406 search results - page 40 / 82 » Pseudorandomness and Combinatorial Constructions |
132
Voted
PAIRING
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
104
Voted
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
80
Voted
APAL
2006
15 years 21 days ago
2006
Abstract. Solovay's random-real forcing ([1]) is the standard way of producing real-valued measurable cardinals. Following questions of Fremlin, by giving a new construction, ...
102
Voted
FGCS
2000
15 years 13 days ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...