649 search results - page 1 / 130 » An Improved Construction of Progression-Free Sets |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
IACR
2011
12 years 4 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
JCT
2006
13 years 4 months ago
2006
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si S; such sets are called Sidon sets if g = 2 a...
ASPDAC
1998
ACM
13 years 9 months ago
1998
ACM
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
CCS
2006
ACM
13 years 8 months ago
2006
ACM
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...