Sciweavers

570 search results - page 14 / 114
» Black-box constructions for secure computation
Sort
View
SCN
2010
Springer
144views Communications» more  SCN 2010»
13 years 6 months ago
Generic Constructions of Parallel Key-Insulated Encryption
Exposure of a secret key is a significant threat in practice. As a notion of security against key exposure, Dodis et al. advocated key-insulated security, and proposed concrete k...
Goichiro Hanaoka, Jian Weng
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
14 years 11 days ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 5 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
ASIACRYPT
2008
Springer
13 years 10 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek