13383 search results - page 390 / 2677 » Abstractions from proofs |
162
click to vote
PKC
2004
Springer
16 years 6 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...
170
click to vote
TCC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
191
click to vote
TYPES
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
158
click to vote
TPHOL
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
167
click to vote
CHARME
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...