Sciweavers

135 search results - page 10 / 27
» Formal Indistinguishability Extended to the Random Oracle Mo...
Sort
View
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
13 years 4 months ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith
ACISP
2007
Springer
13 years 11 months ago
Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards
Abstract. We propose new instantiations of chosen-ciphertext secure identitybased encryption schemes with wildcards (WIBE). Our schemes outperform all existing alternatives in term...
James Birkett, Alexander W. Dent, Gregory Neven, J...
JOC
2011
104views more  JOC 2011»
12 years 10 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
IJAR
2007
86views more  IJAR 2007»
13 years 7 months ago
Joint propagation of probability and possibility in risk analysis: Towards a formal framework
This paper discusses some aspects of fuzzy random variables obtained by propagating uncertainty in risk analysis when some input parameters are stochastic, while others are determ...
Cédric Baudrit, Inés Couso, Didier D...
TCS
2008
13 years 7 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum