Sciweavers

CCS
2008
ACM
15 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
IPMU
2010
Springer
15 years 9 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
CCS
2008
ACM
15 years 9 months ago
Identity-based encryption with efficient revocation
Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). Any setting, PKI- or identit...
Alexandra Boldyreva, Vipul Goyal, Virendra Kumar
CCS
2008
ACM
15 years 9 months ago
Trust management for secure information flows
Mudhakar Srivatsa, Shane Balfe, Kenneth G. Paterso...
IPMU
2010
Springer
15 years 9 months ago
On Elementary Extensions in Fuzzy Predicate Logics
Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We give a characterization of elementary equivalence in fuzzy predicate logics usin...
Pilar Dellunde, Francesc Esteva