Sciweavers

2237 search results - page 121 / 448
» On the Security of Random Sources
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
IJNSEC
2006
85views more  IJNSEC 2006»
15 years 6 months ago
Security Analysis of Some Batch Verifying Signatures from Pairings
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
Tianjie Cao, Dongdai Lin, Rui Xue
PCM
2001
Springer
130views Multimedia» more  PCM 2001»
15 years 10 months ago
Data Encryption Using MRF with an RSA Key
In a digital multimedia era, the security of multimedia over network transmission becomes a challenging issue. A strategy, combining cryptography with steganography, is investigat...
Chaur-Chin Chen
EUROCRYPT
2009
Springer
16 years 6 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
CCS
2011
ACM
14 years 6 months ago
WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction
Parameter tampering attacks are dangerous to a web application whose server fails to replicate the validation of user-supplied data that is performed by the client. Malicious user...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...