Sciweavers

1350 search results - page 27 / 270
» Generalized Committed Choice
Sort
View
CIS
2004
Springer
15 years 2 months ago
General Public Key m-Out-of-n Oblivious Transfer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
Zhide Chen, Hong Zhu
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 1 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
CCS
2008
ACM
14 years 11 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
MSS
2008
IEEE
72views Hardware» more  MSS 2008»
14 years 9 months ago
Measurable systems and behavioral sciences
Individual choices often depend on the order in which the decisions are made. In this paper, we expose a general theory of measurable systems (an example of which is an individual...
V. I. Danilov, Ariane Lambert-Mogiliansky
COOPIS
2002
IEEE
15 years 2 months ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman