116 search results - page 17 / 24 » Min-Wise Independent Permutations |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
ASIACRYPT
2009
Springer
14 years 4 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
EUROCRYPT
2010
Springer
14 years 2 months ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...