Sciweavers

84 search results - page 12 / 17
» Directed Transitive Signature Scheme
Sort
View
CP
2006
Springer
14 years 1 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
ECWEB
2007
Springer
155views ECommerce» more  ECWEB 2007»
14 years 1 months ago
A Secure Payment Protocol for Restricted Connectivity Scenarios in M-Commerce
A significant number of mobile payment systems have been proposed in recent years, most of them based on a scenario where all the entities are directly connected one to another (fo...
Jesús Téllez Isaac, José Sier...
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
14 years 3 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya
EUROPKI
2009
Springer
13 years 7 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
ACSC
2007
IEEE
14 years 4 months ago
Periodical Payment Model Using Restricted Proxy Certificates
In this paper we shall introduce a new electronic payment concept based on the popular direct debit payment model, entitled periodical payments. The direct debit model currently i...
Grigori Goldman