Sciweavers

555 search results - page 79 / 111
» From ABZ to Cryptography
Sort
View
CACM
2005
74views more  CACM 2005»
13 years 9 months ago
Separate handles from names on the internet
Networked communications inherently depend on the ability of the sender of a message to indicate through some token how the message should be delivered to a particular recipient. ...
Michael J. O'Donnell
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
14 years 10 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
EUROCRYPT
2008
Springer
13 years 11 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
ICICS
1997
Springer
14 years 2 months ago
Stateless connections
We describe a secure transformation of stateful connections or parts of them into stateless ones by attaching the state information to the messages. Secret-key cryptography is used...
Tuomas Aura, Pekka Nikander
EUROCRYPT
2006
Springer
14 years 1 months ago
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll ...
Tal Moran, Moni Naor