Sciweavers

2237 search results - page 120 / 448
» On the Security of Random Sources
Sort
View
EUROCRYPT
2001
Springer
15 years 10 months ago
The Bit Security of Paillier's Encryption Scheme and Its Applications
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
Dario Catalano, Rosario Gennaro, Nick Howgrave-Gra...
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
ICWS
2009
IEEE
16 years 3 months ago
Deactivation of Unwelcomed Deep Web Extraction Services through Random Injection
Websites serve content both through Web Services as well as through user-viewable webpages. While the consumers of web-services are typically ‘machines’, webpages are meant fo...
Varun Bhagwan, Tyrone Grandison
ASIACRYPT
2009
Springer
16 years 19 days ago
Simple Adaptive Oblivious Transfer without Random Oracle
Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol whic...
Kaoru Kurosawa, Ryo Nojima
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 10 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram