341 search results - page 30 / 69 » Deniable Functional Encryption |
116
Voted
EUROCRYPT
2011
Springer
14 years 2 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
IACR
2011
13 years 10 months ago
2011
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
117
click to vote
CTRSA
2011
Springer
14 years 2 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
99
Voted
IACR
2011
13 years 10 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
ICISC
2007
15 years 7 days ago
2007
Naor and Reingold had proposed the construction of a strong pseudo-random permutation (SPRP) by using a layer of ECB encryption between two layers of invertible block-wise universa...