Sciweavers

137 search results - page 10 / 28
» Verifiable Attribute Based Encryption
Sort
View
CCS
2008
ACM
13 years 10 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
EPK
2006
114views Management» more  EPK 2006»
13 years 9 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 11 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
JCIT
2010
199views more  JCIT 2010»
13 years 2 months ago
Grey Relational Analysis Method for Multiple Attribute Decision Making in Intuitionistic Fuzzy Setting
The aim of this paper is to investigate the multiple attribute decision making problems with intuitionistic fuzzy information, in which the information about attribute weights is ...
Juchi Hou
CJ
2006
123views more  CJ 2006»
13 years 8 months ago
Unconditionally Secure Anonymous Encryption and Group Authentication
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, H...