119 search results - page 17 / 24 » Finite models for formal security proofs |
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
PKC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
SPE
2011
13 years 2 months ago
2011
Abstract. Two methods have been identified for Event-B model decomposition: shared variable and shared event. The purpose of this paper is to introduce the two approaches and the ...
CANS
2009
Springer
13 years 5 months ago
2009
Springer
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
CRYPTO
2003
Springer
14 years 21 days ago
2003
Springer
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...