Sciweavers

252 search results - page 18 / 51
» How Secure is Deterministic Encryption
Sort
View
ESORICS
2009
Springer
14 years 8 months ago
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new parad...
Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhaka...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 11 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
ASIACRYPT
2000
Springer
13 years 12 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner
EUROCRYPT
2003
Springer
14 years 26 days ago
Cryptanalysis of the Public-Key Encryption Based on Braid Groups
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
Eonkyung Lee, Je Hong Park
PERCOM
2007
ACM
14 years 7 months ago
Identity-Based Encryption for Sensor Networks
In spite of several years of intense research, the area of security and cryptography in Wireless Sensor Networks (WSNs) still has a number of open problems. On the other hand, the...
Leonardo B. Oliveira, Ricardo Dahab, Julio L&oacut...