1411 search results - page 50 / 283 » Interactive Coding for Interactive Proofs |
ICSE
2010
IEEE-ACM
14 years 3 months ago
2010
IEEE-ACM
The size and high rate of change of source code comprising a software system make it difficult for software developers to keep up with who on the team knows about particular parts...
CISIS
2009
IEEE
14 years 3 months ago
2009
IEEE
—In this paper, we show that Web protocols and technologies are good candidates to design the Internet of Things, through a user-centric architecture (the user simply has to use ...
MKM
2005
Springer
14 years 4 months ago
2005
Springer
Recently, significant advances have been made in formalised mathematical texts for large, demanding proofs. But although such large developments are possible, they still take an i...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
FOCS
1990
IEEE
14 years 3 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...