1763 search results - page 338 / 353 » A Formalization of Polytime Functions |
PKC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
113
click to vote
TES
2001
Springer
15 years 2 months ago
2001
Springer
Current developments show that tomorrow’s information systems and applications will no longer be based on monolithic architectures that encompass all the functionality. Rather, t...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
AutoSteve performs automated electrical design based on qualitative simulation and functional abstraction. It is the first commercial product capable of performing these tasks for ...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...