Sciweavers

199 search results - page 17 / 40
» Adaptive Proofs of Knowledge in the Random Oracle Model
Sort
View
EUROCRYPT
2004
Springer
15 years 4 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
13 years 1 months ago
Outsider-Anonymous Broadcast Encryption with Sublinear Ciphertexts
Abstract. In the standard setting of broadcast encryption, information about the receivers is transmitted as part of the ciphertext. In several broadcast scenarios, however, the id...
Nelly Fazio, Irippuge Milinda Perera
EUROCRYPT
2003
Springer
15 years 4 months ago
Why Provable Security Matters?
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
Jacques Stern
EUROCRYPT
2009
Springer
15 years 11 months ago
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...
Jan Camenisch, Nishanth Chandran, Victor Shoup
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 11 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett