Sciweavers

793 search results - page 68 / 159
» Argumentation and standards of proof
Sort
View
AFRICACRYPT
2010
Springer
15 years 7 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
103
Voted
CADE
2001
Springer
16 years 1 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
111
Voted
APLAS
2005
ACM
15 years 6 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
105
Voted
NDJFL
2000
74views more  NDJFL 2000»
15 years 15 days ago
Frege's New Science
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
Aldo Antonelli, Robert May
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 6 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström