19 search results - page 4 / 4 » Succinct NP Proofs from an Extractability Assumption |
IEICET
2006
13 years 5 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
PODS
2000
ACM
13 years 10 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
IACR
2011
12 years 5 months ago
2011
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...