Sciweavers

1744 search results - page 261 / 349
» What's There to Talk About
Sort
View
FLOPS
2004
Springer
14 years 27 days ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 26 days ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
EUC
2006
Springer
14 years 25 days ago
A Scalable and Untraceable Authentication Protocol for RFID
RFID(Radio Frequency Identification) is recently becoming popular, promising and widespread. In contrast, RFID tags can bring about traceability that causes user privacy and reduce...
Youngjoon Seo, Hyunrok Lee, Kwangjo Kim
ASIACRYPT
2003
Springer
14 years 25 days ago
Untraceable Fair Network Payment Protocols with Off-Line TTP
A fair network payment protocol plays an important role in electronic commerce. The fairness concept in payments can be illustrated as that two parties (e.g. customers and merchant...
Chih-Hung Wang
EUROCRYPT
2000
Springer
14 years 23 days ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver