116 search results - page 13 / 24 » Verifying the SET Purchase Protocols |
123
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
129
click to vote
ICFEM
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
146
click to vote
WECWIS
2003
IEEE
15 years 7 months ago
2003
IEEE
Service portals are systems which expose a bundle of web services to the user, allowing the specification and subsequent execution of complex tasks defined over these individual...
136
Voted
FORMATS
2004
Springer
15 years 7 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
143
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...