Sciweavers

175 search results - page 30 / 35
» A Directed Signature Scheme Based on RSA Assumption
Sort
View
78
Voted
CSFW
2009
IEEE
15 years 4 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 2 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
78
Voted
ETRICS
2006
15 years 1 months ago
Revocable Anonymity
Anonymity services in the EU may be forced by the new EU data retention directive to collect connection data and deanonymise some of their users in case of serious crimes. For this...
Stefan Köpsell, Rolf Wendolsky, Hannes Federr...
ICIP
1997
IEEE
15 years 11 months ago
SVD and log-log frequency sampling with Gabor kernels for invariant pictorial recognition
This paper presents an e cient scheme for a neinvariant object recognition. A ne invariance is obtained by a representation which is based on a new sampling con guration in the fr...
Zhiqian Wang, Jezekiel Ben-Arie
IEICET
2006
108views more  IEICET 2006»
14 years 9 months ago
Plaintext Simulatability
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 ...
Eiichiro Fujisaki