Sciweavers

61 search results - page 11 / 13
» On Security Notions for Verifiably Encrypted Signature
Sort
View
ESORICS
2009
Springer
16 years 2 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
116
Voted
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
15 years 5 months ago
Incremental cryptography and application to virus protection
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
Mihir Bellare, Oded Goldreich, Shafi Goldwasser
ESOP
2005
Springer
15 years 7 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
ECCC
2007
185views more  ECCC 2007»
15 years 1 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
DEBS
2010
ACM
15 years 2 months ago
Providing basic security mechanisms in broker-less publish/subscribe systems
The provisioning of basic security mechanisms such as authentication and confidentiality is highly challenging in a content-based publish/subscribe system. Authentication of publi...
Muhammad Adnan Tariq, Boris Koldehofe, Ala' Altawe...