Sciweavers

324 search results - page 41 / 65
» A new signature scheme without random oracles
Sort
View
EUROCRYPT
2003
Springer
14 years 1 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
IACR
2011
101views more  IACR 2011»
12 years 8 months ago
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
Emil Stefanov, Elaine Shi, Dawn Song
IJISEC
2007
87views more  IJISEC 2007»
13 years 8 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
14 years 13 days 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
EUROCRYPT
2004
Springer
14 years 1 months ago
Traceable Signatures
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung