Sciweavers

222 search results - page 34 / 45
» How to Forget a Secret
Sort
View
FC
2005
Springer
104views Cryptology» more  FC 2005»
15 years 3 months ago
Event Driven Private Counters
We define and instantiate a cryptographic scheme called “private counters”, which can be used in applications such as preferential voting to express and update preferences (or...
Eu-Jin Goh, Philippe Golle
115
Voted
ICAIL
2003
ACM
15 years 3 months ago
Developing Legal Knowledge Based Systems Through Theory Construction
Bench-Capon and Sartor have proposed that reasoning with legal cases be seen as a process of theory construction, evaluation and application. They have proposed a set of theory co...
Alison Chorley, Trevor J. M. Bench-Capon
CIA
2001
Springer
15 years 2 months ago
Cryptographic Protocols for Secure Second-Price Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation, task assignment and last but not leas...
Felix Brandt
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
15 years 2 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ARCS
2004
Springer
15 years 1 months ago
A Note on Certificate Path Verification in Next Generation Mobile Communications
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
Matthias Enzmann, Elli Giessler, Michael Haisch, B...