264 search results - page 10 / 53 » Minimal-Latency Secure Function Evaluation |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
This paper presents several watermarking methods preventing the estimation of the secret key by an adversary. The constraints for secure embedding using distribution matching, whe...
COMCOM
2008
13 years 9 months ago
2008
This paper proposes a network-assisted mobile Virtual Private Network (mVPN) security scheme that provides secure remote access to corporate resources over the Universal Mobile Te...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
FSE
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
FSE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...